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

Zuckerman, M., P. Faliszewski, V. Conitzer, and J. S. Rosenschein. “An NTU cooperative game theoretic view of manipulating elections.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7090 LNCS (December 12, 2011): 363–74. https://doi.org/10.1007/978-3-642-25510-6-31. Full Text

Conitzer, V. “Discussion of "a conditional game for comparing approximations".” Journal of Machine Learning Research 15 (December 1, 2011): 72–73.

Conitzer, V., and D. Korzhyk. “Commitment to correlated strategies.” Proceedings of the National Conference on Artificial Intelligence 1 (November 2, 2011): 632–37.

Conitzer, V., T. Walsh, and L. Xia. “Dominating manipulations in voting with partial information.” Proceedings of the National Conference on Artificial Intelligence 1 (November 2, 2011): 638–43.

Wagman, Liad, Vincent Conitzer, and Curtis R. Taylor. “Hide and Seek: Costly Consumer Privacy in a Market with Repeat Purchases,” October 15, 2011.

Naoki, O., C. Vincent, I. Ryo, S. Yuko, I. Atsushi, and Y. Makoto. “Coalition structure generation utilizing compact characteristic function representations.” Transactions of the Japanese Society for Artificial Intelligence 26, no. 3 (May 19, 2011): 451–60. https://doi.org/10.1527/tjsai.26.451. Full Text

Korzhyk, D., Z. Yin, C. Kiekintveld, V. Conitzer, and M. Tambe. “Stackelberg vs. nash in security games: An extended investigation of interchangeability, equivalence, and uniqueness.” Journal of Artificial Intelligence Research 41 (May 1, 2011): 297–327. https://doi.org/10.1613/jair.3269. Full Text

Xia, L., and V. Conitzer. “Determining possible and necessary winners under common voting rules given partial orders.” Journal of Artificial Intelligence Research 41 (May 1, 2011): 25–67. https://doi.org/10.1613/jair.3186. Full Text

Conitzer, V., and T. Sandholm. “Expressive markets for donating to charities.” Artificial Intelligence 175, no. 7–8 (May 1, 2011): 1251–71. https://doi.org/10.1016/j.artint.2010.11.007. Full Text

Korzhyk, D., V. Conitzer, and R. Parr. “Solving stackelberg games with uncertain observability.” 10th International Conference on Autonomous Agents and Multiagent Systems 2011, Aamas 2011 2 (January 1, 2011): 953–60.

Pages

Li, Y., and V. Conitzer. “Complexity of stability-based solution concepts in multi-issue and MC-net cooperative games.” In 13th International Conference on Autonomous Agents and Multiagent Systems, Aamas 2014, 1:581–88, 2014.

Babaioff, Moshe, Vincent Conitzer, and David A. Easley, eds. “ACM Conference on Economics and Computation, EC '14, Stanford , CA, USA, June 8-12, 2014.” In Ec. ACM, 2014.

Conitzer, V. “The maximum likelihood approach to voting on social networks.” In International Symposium on Artificial Intelligence and Mathematics, Isaim 2014, 2014.

Conitzer, V. “The maximum likelihood approach to voting on social networks.” In International Symposium on Artificial Intelligence and Mathematics, Isaim 2014, 2014.

Xu, H., F. Fang, A. X. Jiang, V. Conitzer, S. Dughmi, and M. Tambe. “Solving zero-sum security games in discretized spatio-temporal domains.” In Proceedings of the National Conference on Artificial Intelligence, 2:1500–1506, 2014.

Sørensen, T. B., M. Dalis, J. Letchford, D. Korzhyk, and V. Conitzer. “Beat the cheater: Computing game-theoretic strategies for when to kick a gambler out of a casino.” In Proceedings of the National Conference on Artificial Intelligence, 1:798–804, 2014.

Conitzer, V., and A. Vidali. “Mechanism design for scheduling with uncertain execution time.” In Proceedings of the National Conference on Artificial Intelligence, 1:623–29, 2014.

Freeman, R., M. Brill, and V. Conitzer. “On the axiomatic characterization of runoff voting rules.” In Proceedings of the National Conference on Artificial Intelligence, 1:675–81, 2014.

Letchford, J., and V. Conitzer. “Solving security games on graphs via marginal probabilities.” In Proceedings of the 27th Aaai Conference on Artificial Intelligence, Aaai 2013, 591–97, 2013.

Andersen, G., and V. Conitzer. “Fast equilibrium computation for infinitely repeated games.” In Proceedings of the 27th Aaai Conference on Artificial Intelligence, Aaai 2013, 53–59, 2013.

Pages