Sciweavers

Share
6 search results - page 1 / 2
» A Dynamic Rationalization of Distance Rationalizability
Sort
View
AAAI
2012
10 years 2 months ago
A Dynamic Rationalization of Distance Rationalizability
Distance rationalizability is an intuitive paradigm for developing and studying voting rules: given a notion of consensus and a distance function on preference profiles, a ration...
Craig Boutilier, Ariel D. Procaccia
AAAI
2010
12 years 1 months ago
Good Rationalizations of Voting Rules
The concept of distance rationalizability allows one to define new voting rules or "rationalize" existing ones via a consensus class of elections and a distance. A conse...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
ATAL
2010
Springer
12 years 29 days ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
HYBRID
2007
Springer
12 years 6 months ago
Metrics and Topology for Nonlinear and Hybrid Systems
Abstract. This paper presents an approach to defining distances between nonlinear and hybrid dynamical systems based on formal power series theory. The main idea is that the input...
Mihály Petreczky, René Vidal
CORR
2010
Springer
200views Education» more  CORR 2010»
11 years 12 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
books