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, 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

Jain, M., D. Korzhyk, O. Vaněk, V. Conitzer, M. Pěchouček, and M. Tambe. “A double oracle algorithm for zero-sum security games on graphs.” 10th International Conference on Autonomous Agents and Multiagent Systems 2011, Aamas 2011 1 (January 1, 2011): 305–12.

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.

Xia, L., V. Conitzer, and J. Lang. “Strategic sequential voting in multi-issue domains and multiple-election paradoxes.” Proceedings of the Acm Conference on Electronic Commerce, January 1, 2011, 179–88. https://doi.org/10.1145/1993574.1993602. Full Text

Farfel, J., and V. Conitzer. “Aggregating value ranges: Preference elicitation and truthfulness.” Autonomous Agents and Multi Agent Systems 22, no. 1 (January 1, 2011): 127–50. https://doi.org/10.1007/s10458-009-9118-5. Full Text

Pages

Li, Y., and V. Conitzer. “Optimal Internet auctions with costly communication.” In 12th International Conference on Autonomous Agents and Multiagent Systems 2013, Aamas 2013, 1:683–90, 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.

Conitzer, V., and L. Xia. “Approximating common voting rules by sequential voting in multi-issue domains.” In International Symposium on Artificial Intelligence and Mathematics, Isaim 2012, 2012.

Conitzer, V., and L. Xia. “Paradoxes of multiple elections: An approximation approach.” In 13th International Conference on the Principles of Knowledge Representation and Reasoning, Kr 2012, 179–87, 2012.

Bhattacharya, S., V. Conitzer, and K. Munagala. “Approximation algorithm for security games with costly resources.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7090 LNCS:13–24, 2011. https://doi.org/10.1007/978-3-642-25510-6-2. Full Text

Xia, L., and V. Conitzer. “A maximum likelihood approach towards aggregating partial orders.” In Ijcai International Joint Conference on Artificial Intelligence, 446–51, 2011. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-082. Full Text

Conitzer, V., J. Lang, and L. Xia. “Hypercubewise preference aggregation in multi-issue domains.” In Ijcai International Joint Conference on Artificial Intelligence, 158–63, 2011. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-038. Full Text

Korzhyk, D., V. Conitzer, and R. Parr. “Security games with multiple attacker resources.” In Ijcai International Joint Conference on Artificial Intelligence, 273–79, 2011. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-056. Full Text

Jain, Manish, Dmytro Korzhyk, Ondrej Vanek, Vincent Conitzer, Michal Pechoucek, and Milind Tambe. “A double oracle algorithm for zero-sum security games on graphs..” In Aamas, edited by Liz Sonenberg, Peter Stone, Kagan Tumer, and Pinar Yolum, 327–34. IFAAMAS, 2011.

Conitzer, V., N. Immorlica, J. Letchford, K. Munagala, and L. Wagman. “False-name-proofness in social networks.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6484 LNCS:209–21, 2010. https://doi.org/10.1007/978-3-642-17572-5_17. Full Text

Pages