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., and T. Sandholm. “BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games.” Proceedings, Twentieth International Conference on Machine Learning 1 (December 1, 2003): 91–98.

Conitzer, V., and T. Sandholm. “Complexity of determining nonemptiness of the core.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2003, 613–18.

Conitzer, V., and T. Sandholm. “Automated mechanism design: Complexity results stemming from the single-agent setting.” Acm International Conference Proceeding Series 50 (December 1, 2003): 17–24. https://doi.org/10.1145/948005.948008. Full Text

Conitzer, V., and T. Sandholm. “Complexity results about Nash equilibria.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2003, 765–71.

Conitzer, V., and T. Sandholm. “Definition and complexity of some basic metareasoning problems.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2003, 1099–1106.

Conitzer, V., and T. Sandholm. “Universal voting protocol tweaks to make manipulation hard.” Ijcai International Joint Conference on Artificial Intelligence, December 1, 2003, 781–88.

Conitzer, V., and T. Sandholm. “Automated mechanism design for a self-interested designer.” Proceedings of the Acm Conference on Electronic Commerce, November 19, 2003, 232–33.

Conitzer, V., J. Lang, and T. Sandholm. “How many candidates are needed to make elections hard to manipulate?Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, Tark 2003, June 20, 2003, 201–14. https://doi.org/10.1145/846241.846268. Full Text

Conitzer, V., and T. Sandholm. “Complexity of manipulating elections with few candidates.” Proceedings of the National Conference on Artificial Intelligence, December 1, 2002, 314–19.

Conitzer, V., and T. Sandholm. “Vote elicitation: Complexity and strategy-proofness.” Proceedings of the National Conference on Artificial Intelligence, December 1, 2002, 392–97.

Pages