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

Ohta, N., Y. Sato, A. Iwasaki, M. Yokoo, and V. Conitzer. “Anonymity-proof shapley value: Compact and computationally efficient solution concept for coalitional games in open anonymous environment.” Computer Software 26, no. 4 (December 1, 2009): 181–96.

Guo, M., V. Conitzer, and D. M. Reeves. “Competitive repeated allocation without payments.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5929 LNCS (December 1, 2009): 244–55. https://doi.org/10.1007/978-3-642-10841-9_23. Full Text

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.

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

Conitzer, Vincent, Curtis R. Taylor, and Liad Wagman. “Who Benefits from Online Privacy?,” August 15, 2009. Open Access Copy

Conitzer, V. “Eliciting single-peaked preferences using comparison queries.” Journal of Artificial Intelligence Research 35 (August 13, 2009): 161–91.

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

Pages

Conitzer, V., and T. Sandholm. “Incremental mechanism design.” In Ijcai International Joint Conference on Artificial Intelligence, 1251–56, 2007.

Conitzer, V. “Limited verification of identities to induce false-name-proofness.” In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge, Tark 2007, 102–11, 2007. https://doi.org/10.1145/1324249.1324265. Full Text

Conitzer, Vincent. “Limited Verification of Identities to Induce False-Name-Proofness..” In Computational Social Systems and the Internet, edited by Peter Cramton, Rudolf Müller, Éva Tardos, and Moshe Tennenholtz, Vol. 07271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

Conitzer, Vincent. “Anonymity-Proof Voting Rules..” In Computational Social Systems and the Internet, edited by Peter Cramton, Rudolf Müller, Éva Tardos, and Moshe Tennenholtz, Vol. 07271. Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.

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.

Pages