Vincent Conitzer

Vincent Conitzer

Professor in the Department of Economics

External Address: 
LSRC D207, Durham, NC 27708
Internal Office Address: 
Box 90129, Durham, NC 27708-0129
Phone: 
(919) 660-6503

Education

  • Ph.D., Carnegie Mellon University 2006
  • M.S., Carnegie Mellon University 2003
  • B.A., Harvard University 2001

Conitzer, V. “Making decisions based on the preferences of multiple agents.” Communications of the Acm 53, no. 3 (March 1, 2010): 84–94. https://doi.org/10.1145/1666420.1666442. Full Text

Conitzer, V. “Using a memory test to limit a user to one account.” Lecture Notes in Business Information Processing 44 LNBIP (January 1, 2010): 60–72. https://doi.org/10.1007/978-3-642-15237-5_5. Full Text

Conitzer, V., and M. Yokoo. “Using mechanism design to prevent false-name manipulations.” Ai Magazine 31, no. 4 (January 1, 2010): 65–77. https://doi.org/10.1609/aimag.v31i4.2315. Full Text

Korzhyk, D., V. Conitzer, and R. Parr. “Complexity of computing optimal Stackelberg strategies in security resource allocation games.” Proceedings of the National Conference on Artificial Intelligence 2 (January 1, 2010): 805–10.

Guo, M., and V. Conitzer. “Computationally feasible automated mechanism design: General approach and case studies.” Proceedings of the National Conference on Artificial Intelligence 3 (January 1, 2010): 1676–79.

Xia, L., and V. Conitzer. “Stackelberg voting games: Computational aspects and paradoxes.” Proceedings of the National Conference on Artificial Intelligence 2 (January 1, 2010): 921–26.

Xia, L., and V. Conitzer. “Compilation complexity of common voting rules.” Proceedings of the National Conference on Artificial Intelligence 2 (January 1, 2010): 915–20.

Conitzer, Vincent. “Editor's puzzle.” Acm Sigecom Exchanges 8, no. 2 (December 2009): 1–1. https://doi.org/10.1145/1980522.1980532. Full Text

Conitzer, V. “Prediction markets, mechanism design, and cooperative game theory.” Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence, Uai 2009, December 1, 2009, 101–8.

Harrenstein, B. P., M. M. De Weerdt, and V. Conitzer. “A qualitative Vickrey auction.” Proceedings of the Acm Conference on Electronic Commerce, December 1, 2009, 197–206. https://doi.org/10.1145/1566374.1566403. Full Text

Pages

Xia, L., and V. Conitzer. “A maximum likelihood approach towards aggregating partial orders.” In Ijcai International Joint Conference on Artificial Intelligence, 446–51, 2011. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-082. Full Text

Jain, Manish, Dmytro Korzhyk, Ondrej Vanek, Vincent Conitzer, Michal Pechoucek, and Milind Tambe. “A double oracle algorithm for zero-sum security games on graphs.” In Aamas, edited by Liz Sonenberg, Peter Stone, Kagan Tumer, and Pinar Yolum, 327–34. IFAAMAS, 2011.

Conitzer, V., N. Immorlica, J. Letchford, K. Munagala, and L. Wagman. “False-name-proofness in social networks.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6484 LNCS:209–21, 2010. https://doi.org/10.1007/978-3-642-17572-5_17. Full Text

Bhattacharya, S., V. Conitzer, K. Munagala, and L. Xia. “Incentive compatible budget elicitation in multi-unit auctions.” In Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, 554–72, 2010. https://doi.org/10.1137/1.9781611973075.47. Full Text

Guo, M., and V. Conitzer. “Strategy-proof allocation of multiple items between two agents without payments or priors.” In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, Aamas, 2:881–88, 2010.

Yin, Z, Korzhyk, D, Kiekintveld, C, Conitzer, V, and Tambe, M. "Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness." January 1, 2010.

Xia, L., V. Conitzer, and J. Lang. “Aggregating preferences in multi-issue domains by using maximum likelihood estimators.” In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, Aamas, 1:399–406, 2010.

Iwasaki, A., V. Conitzer, Y. Omori, Y. Sakurai, T. Todo, M. Guo, and M. Yokoo. “Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms.” In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, Aamas, 1:633–40, 2010.

Brandt, Felix, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, and William S. Zwicker. “10101 Abstracts Collection - Computational Foundations of Social Choice.” In Computational Foundations of Social Choice, edited by Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, and William S. Zwicker, Vol. 10101. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2010.

Brandt, Felix, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, and William S. Zwicker. “10101 Executive Summary - Computational Foundations of Social Choice.” In Computational Foundations of Social Choice, edited by Felix Brandt, Vincent Conitzer, Lane A. Hemaspaandra, Jean-François Laslier, and William S. Zwicker, Vol. 10101. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2010.

Pages