Sciweavers

10715 search results - page 91 / 2143
» From Tests to Proofs
Sort
View
DAGSTUHL
2007
13 years 10 months ago
Anonymity-Proof Voting Rules
A (randomized, anonymous) voting rule maps any multiset of total orders (aka. votes) over a fixed set of alternatives to a probability distribution over these alternatives. A voti...
Vincent Conitzer
CORR
2002
Springer
108views Education» more  CORR 2002»
13 years 9 months ago
Vote Elicitation: Complexity and Strategy-Proofness
Preference elicitation is a central problem in AI, and has received significant attention in single-agent settings. It is also a key problem in multiagent systems, but has receive...
Vincent Conitzer, Tuomas Sandholm
MLQ
2010
99views more  MLQ 2010»
13 years 7 months ago
Proof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modifi...
Jaime Gaspar, Paulo Oliva
WINE
2010
Springer
109views Economy» more  WINE 2010»
13 years 7 months ago
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
In this paper, we characterize strategy-proof voting rules when the set of alternatives has a multi-issue structure, and the voters' preferences are represented by acyclic CP-...
Lirong Xia, Vincent Conitzer
WINE
2010
Springer
148views Economy» more  WINE 2010»
13 years 7 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...