Voting procedures with incomplete preferences

Voting procedures with incomplete preferences (2005)

by Kathrin Konczak

Venue:	in Proc. IJCAI-05 Multidisciplinary Workshop on Advances in Preference Handling
Citations:	95 - 11 self

112	Universal voting protocol tweaks to make manipulation hard. - Conitzer, Sandholm - 2003
96	Logical preference representation and combinatorial vote. - Lang - 2004
86	Vote elicitation: Complexity and strategy-proofness. - Conitzer, Sandholm - 2002
78	Complexity of manipulating elections with few candidates, in: - Conitzer, Sandholm - 2002
66	Preference-based constrained optimization with CP-Nets. - Boutilier, Brafman, et al. - 2004
58	mCP nets: Representing and reasoning with preferences of multiple agents. In - Rossi, Venable, et al. - 2004
50	The complexity of Kemeny elections. - Hemaspaandra, Spakowski, et al. - 2005
26	A computational study of the Kemeny rule for preference aggregation - Davenport, Kalagnanam - 2004
8	How many candidates are required to make an election hard to manipulate?, in: - Conitzer, Lang, et al. - 2003
2	Handbook of Social Choice and Welfare, volume 1, chapter Voting procedures - Brams, Fishburn - 2003
1	A logical approach to qualitative decision theory - Boutilier - 1994
1	Exact complexity of the winner determination problem in young elections - Rothe, Spakowski, et al.
1	Qualitative decision theory: specification and representation of preferences under uncertainty - Tan, Pearl - 1994