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, Vincent. “Editor's puzzle.” Acm Sigecom Exchanges 8, no. 2 (December 1, 2009): 1–1. https://doi.org/10.1145/1980522.1980532. Full Text

Xia, L., and V. Conitzer. “Finite local consistency characterizes generalized scoring rules.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2009, 336–41.

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.

Xia, L., M. Zuckerman, A. D. Procaccia, V. Conitzer, and J. S. Rosenschein. “Complexity of unweighted coalitional manipulation under some common voting rules.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2009, 348–53.

Halvorson, E., V. Conitzer, and R. Parr. “Multi-step multi-sensor hider-seeker games.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2009, 159–66.

Conitzer, V., M. Rognlie, and L. Xia. “Preference functions that score rankings and maximum likelihood estimation.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2009, 109–15.

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

Conitzer, V. “Approximation guarantees for fictitious play.” 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, December 1, 2009, 636–43. https://doi.org/10.1109/ALLERTON.2009.5394918. Full Text

Ohta, N., V. Conitzer, R. Ichimura, Y. Sakurai, A. Iwasaki, and M. Yokoo. “Coalition structure generation utilizing compact characteristic function representations.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5732 LNCS (November 2, 2009): 623–38. https://doi.org/10.1007/978-3-642-04244-7_49. Full Text

Guo, M., and V. Conitzer. “Worst-case optimal redistribution of VCG payments in multi-unit auctions.” Games and Economic Behavior 67, no. 1 (September 1, 2009): 69–98. https://doi.org/10.1016/j.geb.2008.06.007. Full Text

Pages

Conitzer, Vincent. “Invited talk by winner of IFAAMAS Victor Lesser Distinguished Dissertation Award..” In Aamas, edited by Edmund H. Durfee, Makoto Yokoo, Michael N. Huhns, and Onn Shehory, 253–253. IFAAMAS, 2007.

Yokoo, M., V. Conitzer, T. Sandholm, N. Ohta, and A. Iwasaki. “Coalitional games in open anonymous environments.” In Ijcai International Joint Conference on Artificial Intelligence, 1668–69, 2005.

Conitzer, V., and T. Sandholm. “Complexity of determining nonemptiness of the core.” In Proceedings of the Acm Conference on Electronic Commerce, 230–31, 2003.

Conitzer, Vincent, Jérôme Lang, and Tuomas Sandholm. “How many candidates are needed to make elections hard to manipulate?.” In Tark, edited by Joseph Y. Halpern and Moshe Tennenholtz, 201–14. ACM, 2003.

Conitzer, Vincent, and Tuomas Sandholm. “AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents..” In Icml, edited by Tom Fawcett and Nina Mishra, 83–90. AAAI Press, 2003.

Conitzer, Vincent, and Tuomas Sandholm. “BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games..” In Icml, edited by Tom Fawcett and Nina Mishra, 91–98. AAAI Press, 2003.

Conitzer, Vincent, and Tuomas Sandholm. “Definition and Complexity of Some Basic Metareasoning Problems..” In Ijcai, edited by Georg Gottlob and Toby Walsh, 1099–1106. Morgan Kaufmann, 2003.

Conitzer, Vincent, and Tuomas Sandholm. “Universal Voting Protocol Tweaks to Make Manipulation Hard..” In Ijcai, edited by Georg Gottlob and Toby Walsh, 781–88. Morgan Kaufmann, 2003.

Conitzer, V., and T. Sandholm. “Complexity of determining nonemptiness of the core.” In Ijcai International Joint Conference on Artificial Intelligence, 613–18, 2003.

Conitzer, Vincent, and Tuomas Sandholm. “Vote Elicitation: Complexity and Strategy-Proofness..” In Aaai/Iaai, edited by Rina Dechter, Michael J. Kearns, and Richard S. Sutton, 392–97. AAAI Press / The MIT Press, 2002.

Pages