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

Waggoner, B., L. Xia, and V. Conitzer. “Evaluating resistance to false-name manipulations in elections.” Proceedings of the National Conference on Artificial Intelligence 2 (November 7, 2012): 1485–91.

Conitzer, V. “Should social network structure be taken into account in elections?.” Mathematical Social Sciences 64, no. 1 (July 1, 2012): 100–102. https://doi.org/10.1016/j.mathsocsci.2011.03.006. Full Text

Conitzer, V., C. R. Taylor, and L. Wagman. “Hide and seek: Costly consumer privacy in a market with repeat purchases.” Marketing Science 31, no. 2 (March 1, 2012): 277–92. https://doi.org/10.1287/mksc.1110.0691. Full Text

Wagman, L., and V. Conitzer. “Choosing fair lotteries to defeat the competition.” International Journal of Game Theory 41, no. 1 (February 1, 2012): 91–129. https://doi.org/10.1007/s00182-011-0275-9. Full Text

Conitzer, V., and T. Sandholm. “Computing optimal outcomes under an expressive representation of settings with externalities.” Journal of Computer and System Sciences 78, no. 1 (January 1, 2012): 2–14. https://doi.org/10.1016/j.jcss.2011.02.009. Full Text

Guo, Mingyu, and Vincent Conitzer. “False-name-proofness with Bid Withdrawal.” Corr abs/1208.6501 (2012).

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

Guo, M., V. Naroditskiy, V. Conitzer, A. Greenwald, and N. R. Jennings. “Budget-balanced and nearly efficient randomized mechanisms: Public goods and beyond.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7090 LNCS (December 12, 2011): 158–69. https://doi.org/10.1007/978-3-642-25510-6-14. 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.

Pages

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.

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 Easley, eds. “ACM Conference on Economics and Computation, EC '14, Stanford , CA, USA, June 8-12, 2014.” In Ec. ACM, 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.

Todo, T., and V. Conitzer. “False-name-proof matching.” In 12th International Conference on Autonomous Agents and Multiagent Systems 2013, Aamas 2013, 1:311–18, 2013.

Pages