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

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

Anand, S. S., R. Bunescu, V. Carvcdho, J. Chomicki, V. Conitzer, M. T. Cox, V. Dignum, et al. “AAAI 2008 workshop reports.” Ai Magazine 30, no. 1 (January 1, 2009): 108–18. https://doi.org/10.1609/aimag.v30i1.2196. Full Text

Conitzer, V., J. Lang, and L. Xia. “How hard is it to control sequential elections via the agenda?Ijcai International Joint Conference on Artificial Intelligence, January 1, 2009, 103–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, January 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, January 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, January 1, 2009, 109–15.

Wagman, L., and V. Conitzer. “Optimal false-name-proof voting rules with costly voting.” Proceedings of the National Conference on Artificial Intelligence 1 (December 29, 2008): 190–95.

Xia, L., V. Conitzer, and J. Lang. “Voting on multiattribute domains with cyclic preferential dependencies.” Proceedings of the National Conference on Artificial Intelligence 1 (December 24, 2008): 202–7.

Xia, L., and V. Conitzer. “Determining possible and necessary winners under common voting rules given partial orders.” Proceedings of the National Conference on Artificial Intelligence 1 (December 24, 2008): 196–201.

Guo, M., and V. Conitzer. “Better redistribution with inefficient allocation in multi-unit auctions with unit demand.” Proceedings of the Acm Conference on Electronic Commerce, December 1, 2008, 210–19. https://doi.org/10.1145/1386790.1386825. Full Text

Pages

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.

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.

Pages