6 search results - page 1 / 2 » A Dynamic Rationalization of Distance Rationalizability |
AAAI
2012
11 years 7 months ago
2012
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...
AAAI
2010
13 years 6 months ago
2010
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...
ATAL
2010
Springer
13 years 5 months ago
2010
Springer
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...
HYBRID
2007
Springer
13 years 10 months ago
2007
Springer
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...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
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...