Vincent Conitzer
Geciteerd door
Geciteerd door
Handbook of computational social choice
F Brandt, V Conitzer, U Endriss, J Lang, AD Procaccia
Cambridge University Press, 2016
Computing the optimal strategy to commit to
V Conitzer, T Sandholm
Proceedings of the 7th ACM conference on Electronic commerce, 82-90, 2006
When are elections with few candidates hard to manipulate?
V Conitzer, T Sandholm, J Lang
Journal of the ACM (JACM) 54 (3), 14-es, 2007
Complexity of mechanism design
V Conitzer, T Sandholm
arXiv preprint cs/0205075, 2002
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
V Conitzer, T Sandholm
Machine Learning 67 (1-2), 23-43, 2007
Complexity results about Nash equilibria
V Conitzer, T Sandholm
arXiv preprint cs/0205074, 2002
Stackelberg vs. Nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness
D Korzhyk, Z Yin, C Kiekintveld, V Conitzer, M Tambe
Journal of Artificial Intelligence Research 41, 297-327, 2011
Determining possible and necessary winners given partial orders
L Xia, V Conitzer
Journal of Artificial Intelligence Research 41, 25-67, 2011
New complexity results about Nash equilibria
V Conitzer, T Sandholm
Games and Economic Behavior 63 (2), 621-641, 2008
Computational social choice
F Brandt, V Conitzer, U Endriss
Multiagent systems, 213-283, 2012
Common voting rules as maximum likelihood estimators
V Conitzer, T Sandholm
arXiv preprint arXiv:1207.1368, 2012
A double oracle algorithm for zero-sum security games on graphs
M Jain, D Korzhyk, O Vaněk, V Conitzer, M Pěchouček, M Tambe
The 10th International Conference on Autonomous Agents and Multiagent …, 2011
Justified representation in approval-based committee voting
H Aziz, M Brill, V Conitzer, E Elkind, R Freeman, T Walsh
Social Choice and Welfare 48 (2), 461-485, 2017
Complexity of computing optimal stackelberg strategies in security resource allocation games
D Korzhyk, V Conitzer, R Parr
Twenty-fourth aaai conference on artificial intelligence, 2010
Improved bounds for computing Kemeny rankings
V Conitzer, A Davenport, J Kalagnanam
AAAI 6, 620-626, 2006
Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains
V Conitzer, T Sandholm
AAAI 4, 219-225, 2004
Mixed-integer programming methods for finding Nash equilibria
T Sandholm, A Gilpin, V Conitzer
AAAI, 495-501, 2005
Preference functions that score rankings and maximum likelihood estimation
V Conitzer, M Rognlie, L Xia
Twenty-First International Joint Conference on Artificial Intelligence, 2009
Universal voting protocol tweaks to make manipulation hard
V Conitzer, T Sandholm
arXiv preprint cs/0307018, 2003
Vote elicitation: Complexity and strategy-proofness
V Conitzer, T Sandholm
AAAI/IAAI, 392-397, 2002
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20