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 9, no. 1 (June 1, 2010): 1–2. https://doi.org/10.1145/1980534.1980543. Full Text

Bhattacharya, S., V. Conitzer, K. Munagala, and L. Xia. “Incentive compatible budget elicitation in multi-unit auctions.” Proceedings of the Annual Acm Siam Symposium on Discrete Algorithms, May 6, 2010, 554–72.

Conitzer, V. “Comparing multiagent systems research in combinatorial auctions and voting.” Annals of Mathematics and Artificial Intelligence 58, no. 3 (April 1, 2010): 239–59. https://doi.org/10.1007/s10472-010-9205-y. Full Text

Guo, M., and V. Conitzer. “Optimal-in-expectation redistribution mechanisms.” Artificial Intelligence 174, no. 5–6 (April 1, 2010): 363–81. https://doi.org/10.1016/j.artint.2009.12.003. Full Text

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

Letchford, J., V. Conitzer, and K. Munagala. “Learning and approximating the optimal strategy to commit to.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5814 LNCS (December 14, 2009): 250–62. https://doi.org/10.1007/978-3-642-04645-2_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.

Pages

Apt, Krzysztof R., Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. “Welfare Undominated Groves Mechanisms..” In Wine, edited by Christos H. Papadimitriou and Shuzhong Zhang, 5385:426–37. Springer, 2008.

Guo, Mingyu, and Vincent Conitzer. “Optimal-in-expectation redistribution mechanisms..” In Aamas (2), edited by Lin Padgham, David C. Parkes, Jörg P. Müller, and Simon Parsons, 1047–54. IFAAMAS, 2008.

Wagman, Liad, and Vincent Conitzer. “Strategic betting for competitive agents..” In Aamas (2), edited by Lin Padgham, David C. Parkes, Jörg P. Müller, and Simon Parsons, 847–54. IFAAMAS, 2008.

Guo, Mingyu, and Vincent Conitzer. “Undominated VCG redistribution mechanisms..” In Aamas (2), edited by Lin Padgham, David C. Parkes, Jörg P. Müller, and Simon Parsons, 1039–46. IFAAMAS, 2008.

Ohta, Naoki, Vincent Conitzer, Yasufumi Satoh, Atsushi Iwasaki, and Makoto Yokoo. “Anonymity-proof Shapley value: extending shapley value for coalitional games in open environments..” In Aamas (2), edited by Lin Padgham, David C. Parkes, Jörg P. Müller, and Simon Parsons, 927–34. IFAAMAS, 2008.

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

Sandholm, T., V. Conitzer, and C. Boutilier. “Automated design of multistage mechanisms.” In Ijcai International Joint Conference on Artificial Intelligence, 1500–1506, 2007.

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

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.

Pages