Sciweavers

5 search results - page 1 / 1
» Socially desirable approximations for Dodgson's voting rule
Sort
View
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
AAAI
2012
11 years 7 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
ALDT
2011
Springer
200views Algorithms» more  ALDT 2011»
12 years 5 months ago
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
Tyler Lu, Craig Boutilier
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
The unavailable candidate model: a decision-theoretic view of social choice
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
Tyler Lu, Craig Boutilier
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 5 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...