Vincent Conitzer
Assistant Professor of Computer Science and Economics

Levine Science Research Center, office D207
Box 90129, Duke University
Durham, NC 27708, USA
Office phone: (919) 660-6503, fax: (919) 660-6519
If you know my old Pittsburgh (412) mobile phone number, just add 5073037689 to it to get my new one.

If you cannot reach me and the matter is urgent, please contact Camelia.
Jump to: announcements, teaching, research interests, research group, brief bio, service, publications (by date or topic), miscellaneous, humor.
ANNOUNCEMENTS
TEACHING
CPS 270 (Fall 2008): Artificial Intelligence.
CPS 196/296.2 (Spring 2008): Linear and Integer Programming.
CPS 196.2 (Fall 2007): Introduction to Computational Economics.
CPS 296.3 (Spring 2007): Topics in Computational Economics.
CPS 296.2 (Fall 2006): Computational Game Theory and Mechanism Design.
RESEARCH INTERESTS
My research focuses on issues in the intersection of computer science (especially artificial intelligence) and economics. This includes the design of new marketplaces and other negotiation protocols that allow humans and software agents to express their preferences naturally and accurately, and that generate good outcomes based on these preferences. It also includes the design of software agents that can act strategically in settings where multiple parties all pursue their own interests. This requires the use of concepts from game theory, as well as operationalizing these concepts by finding efficient algorithms for computing the corresponding solutions. Finally, my research includes the study of all settings in computer science in which multiple parties will act in their own self-interest, as well as the design of incentive mechanisms to reach good outcomes in spite of such behavior. I am also interested in preventing the use of false identifiers (sybil attacks).
Some of the Wikipedia entries linked to above are imperfect; hopefully they will get better!

Keywords: Computational microeconomics; artificial intelligence; multiagent systems; electronic commerce; game theory; mechanism design; auctions & exchanges; social choice & voting; false-name-proofness; public goods & externalities; coalition formation; anonymity-proofness; preference elicitation; resource-bounded reasoning; learning in games; game playing; computational & communication complexity; optimization; search; machine learning.
RESEARCH GROUP
Information for students applying to my group.
Advice/opinions for students in my group.
Current Ph.D. students: Mingyu Guo (Computer Science), Joshua (Josh) Letchford (Computer Science), Liad (Leo) Wagman (Economics), Lirong Xia (Computer Science).
Alumni: Joseph (Joe) Farfel (Computer Science M.S. 2007).
BRIEF BIO
Professional (for talk anouncements etc.): Vincent Conitzer is an Assistant Professor of Computer Science and Economics at Duke University. His research focuses on computational aspects of microeconomics, in particular game theory, mechanism design, voting/social choice, and auctions; his work also involves techniques from artificial intelligence and multiagent systems. He received Ph.D. (2006) and M.S. (2003) degrees in Computer Science from Carnegie Mellon University, and an A.B. (2001) degree in Applied Mathematics from Harvard University. He also received an Alfred P. Sloan Research Fellowship (2008), an Honorable Mention for the 2007 ACM Doctoral Dissertation Award, the 2006 IFAAMAS Victor Lesser Distinguished Dissertation Award, the AAMAS Best Program Committee Member Award (2006), and an IBM Ph.D. Fellowship (2005). He is a co-author on papers winning a AAAI-08 Outstanding Paper Award and the AAMAS-08 Pragnesh Jay Modi Best Student Paper Award.

Personal: I grew up in Amsterdam, the Netherlands, and now live in Durham with my wife, Christina. I enjoy sports including judo, soccer, and tennis, and at Duke it is hard to avoid playing basketball...

For more information, please see my CV.
SERVICE
Editor-in-chief of SIGecom Exchanges, and associate editor of JAAMAS. Steering committee of AMMA-09. Publicity chair and senior program committee of AAMAS-08. Program co-chair of the multidisciplinary workshop on advances on preference handling. Program committees of EC-08, AAAI-08, UAI-08, ISAIM-08, COMSOC-08, AMEC-08, and Metareasoning-08.
PUBLICATIONS
By date; you can also see them by topic (automatically generated from this page, please let me know if you would like the code for this).

2008
Vincent Conitzer, Matthew Rognlie, and Lirong Xia. Preference Functions That Score Rankings and Maximum Likelihood Estimation. To appear in the Second International Workshop on Computational Social Choice (COMSOC-08), Liverpool, England. Keywords: voting, optimal voting rules.

Lirong Xia, Vincent Conitzer, Ariel Procaccia, and Jeffrey Rosenschein. Complexity of unweighted coalitional manipulation under some common voting rules. To appear in the Second International Workshop on Computational Social Choice (COMSOC-08), Liverpool, England. Keywords: voting, hardness of manipulation.

Mingyu Guo and Vincent Conitzer. Better Redistribution with Inefficient Allocation in Multi-Unit Auctions with Unit Demand. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC-08), pp. 210-219, Chicago, IL, USA, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

Lirong Xia and Vincent Conitzer. A Sufficient Condition for Voting Rules to Be Frequently Manipulable. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC-08), pp. 99-108, Chicago, IL, USA, 2008. Keywords: voting, hardness of manipulation.

Lirong Xia and Vincent Conitzer. Generalized Scoring Rules and the Frequency of Coalitional Manipulability. In Proceedings of the 9th ACM Conference on Electronic Commerce (EC-08), pp. 109-118, Chicago, IL, USA, 2008. Keywords: voting, hardness of manipulation.

Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. To appear in Games and Economic Behavior, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

Liad Wagman and Vincent Conitzer. Optimal False-Name-Proof Voting Rules with Costly Voting. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-08), pp. 190-195, Chicago, IL, USA, 2008. Winner of one of two Outstanding Paper Awards. Keywords: anonymity-proofness, voting, mechanism design.

Lirong Xia and Vincent Conitzer. Determining Possible and Necessary Winners under Common Voting Rules Given Partial Orders. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-08), pp. 196-201, Chicago, IL, USA, 2008. Keywords: voting, winner determination, preference elicitation, hardness of manipulation.

Lirong Xia, Vincent Conitzer, and Jérôme Lang. Voting on Multiattribute Domains with Cyclic Preferential Dependencies. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-08), pp. 202-207, Chicago, IL, USA, 2008. Keywords: voting, voting in combinatorial domains.

Vincent Conitzer. Anonymity-Proof Voting Rules. In submission. Keywords: anonymity-proofness, voting, mechanism design.

Vincent Conitzer and Tuomas Sandholm. New Complexity Results about Nash Equilibria. Games and Economic Behavior, Volume 63, Issue 2, 2008, pp. 621-641. Keywords: noncooperative game theory, Nash equilibrium.

Mingyu Guo and Vincent Conitzer. Optimal-in-Expectation Redistribution Mechanisms. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-08), pp. 1047-1054, Estoril, Portugal, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

Mingyu Guo and Vincent Conitzer. Undominated VCG Redistribution Mechanisms. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-08), pp. 1039-1046, Estoril, Portugal, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

Liad Wagman and Vincent Conitzer. Strategic Betting for Competitive Agents. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-08), pp. 847-854, Estoril, Portugal, 2008. Keywords: noncooperative game theory, Nash equilibrium.

Naoki Ohta, Vincent Conitzer, Yasufumi Satoh, Atsushi Iwasaki, and Makoto Yokoo. Anonymity-Proof Shapley Value: Extending Shapley Value for Coalitional Games in Open Environments. In Proceedings of the 7th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-08), pp. 927-934, Estoril, Portugal, 2008. Winner of the Pragnesh Jay Modi Best Student Paper Award. Keywords: cooperative game theory, anonymity-proofness, collusion, Shapley value.

Vincent Conitzer. Comparing Multiagent Systems Research in Combinatorial Auctions and Voting. The 10th International Symposium on Artificial Intelligence and Mathematics (ISAIM-08), Fort Lauderdale, FL, USA. (Paper corresponding to an invited talk.) Keywords: combinatorial auctions and exchanges, voting, overviews.

Vincent Conitzer. Auction Protocols. Chapter to appear in the CRC Algorithms and Theory of Computation Handbook. Keywords: combinatorial auctions and exchanges, overviews.

Vincent Conitzer. Using a Memory Test to Limit a User to One Account. The 10th International Workshop on Agent Mediated Electronic Commerce (AMEC-08), Estoril, Portugal. Keywords: anonymity-proofness.

Vincent Conitzer. Metareasoning as a Formal Computational Problem. The AAAI-08 Workshop on Metareasoning: Thinking about Thinking, Chicago, IL, USA, 2008. Keywords: resource-bounded reasoning.

Mehmet Serkan Apaydin, Vincent Conitzer, and Bruce Randall Donald. Structure-based protein NMR assignments using native structural ensembles. Journal of Biomolecular NMR, 2008; 40(4):263-276. PMID: 18365752. Keywords: computational biology.


2007
Vincent Conitzer. Limited Verification of Identities to Induce False-Name-Proofness. In Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-07), pp. 102-111, Brussels, Belgium. Keywords: anonymity-proofness, mechanism design, combinatorial auctions and exchanges, voting.

Vincent Conitzer, Tuomas Sandholm, and Jérôme Lang. When Are Elections with Few Candidates Hard to Manipulate? Journal of the ACM, Volume 54, Issue 3, June 2007, Article 14, pp. 1-33. Supersedes "How Many Candidates Are Needed to Make Elections Hard to Manipulate?" (TARK-03, pp. 201-214) and "Complexity of Manipulating Elections with Few Candidates" (AAAI-02, pp. 314-319). Keywords: voting, hardness of manipulation.

Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments. In Proceedings of the 8th ACM Conference on Electronic Commerce (EC-07), pp. 30-39, San Diego, CA, USA. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

Vincent Conitzer. Eliciting Single-Peaked Preferences Using Comparison Queries. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-07), pp. 408-415, Honolulu, HI, USA, 2007. Keywords: voting, preference elicitation, single-peaked preferences.

Vincent Conitzer and Tuomas Sandholm. Incremental Mechanism Design. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 1251-1256, Hyderabad, India, 2007. Keywords: mechanism design, automated mechanism design, VCG mechanism, voting, hardness of manipulation.

Tuomas Sandholm, Vincent Conitzer, and Craig Boutilier. Automated Design of Multistage Mechanisms. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 1500-1506, Hyderabad, India, 2007. Keywords: mechanism design, automated mechanism design, preference elicitation.

Vincent Conitzer and Tuomas Sandholm. AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents. Machine Learning, Special Issue on Learning and Computational Game Theory, Volume 67, Numbers 1-2, May 2007, pp. 23-43. Earlier version appeared in Proceedings of the 20th International Conference on Machine Learning (ICML-03), pp. 83-90, Washington, DC, USA, 2003. Keywords: noncooperative game theory, learning in games, Nash equilibrium.


2006
Vincent Conitzer. Computational Aspects of Preference Aggregation. Ph.D. Dissertation. Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, July 2006. Available as technical report CMU-CS-06-145. Winner of the 2006 IFAAMAS Victor Lesser Distinguished Dissertation Award and an Honorable Mention for the 2007 ACM Doctoral Dissertation Award. Abstract, acknowledgements, contents. Chapter 1: Introduction. Chapter 2: Expressive Preference Aggregation Settings (review of voting, task and resource allocation, and other settings). Chapter 3: Outcome Optimization (winner determination in voting, combinatorial auctions, and other settings). Chapter 4: Mechanism Design (review). Chapter 5: Difficulties for Classical Mechanism Design (limitations of VCG and other impossibilities). Chapter 6: Automated Mechanism Design. Chapter 7: Game-Theoretic Foundations of Mechanism Design (review of game theory and the revelation principle). Chapter 8: Mechanism Design for Bounded Agents (revelation principle failure and hardness of manipulation in voting). Chapter 9: Computing Game-Theoretic Solutions (Nash equilibrium, dominance, and others). Chapter 10: Automated Mechanism Design for Bounded Agents (incremental mechanism design). Chapter 11: Conclusions and Future Research. Bibliography. Keywords: overviews.

Vincent Conitzer and Tuomas Sandholm. Complexity of Constructing Solutions in the Core Based on Synergies Among Coalitions. Artificial Intelligence, Volume 170, Issues 6-7, May 2006, pp. 607-619. Earlier version appeared as "Complexity of Determining Nonemptiness of the Core" in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 613-618, Acapulco, Mexico, 2003. Keywords: cooperative game theory, core.

Vincent Conitzer and Tuomas Sandholm. Computing the Optimal Strategy to Commit to. In Proceedings of the 7th ACM Conference on Electronic Commerce (EC-06), pp. 82-90, Ann Arbor, MI, USA, 2006. Keywords: noncooperative game theory, commitment.

Vincent Conitzer. Computing Slater Rankings Using Similarities Among Candidates. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), pp. 613-619, Boston, MA, USA, 2006. Early version: IBM Research Report RC23748. Keywords: voting, winner determination.

Vincent Conitzer, Andrew Davenport, and Jayant Kalagnanam. Improved Bounds for Computing Kemeny Rankings. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), pp. 620-626, Boston, MA, USA, 2006. Keywords: voting, winner determination.

Vincent Conitzer and Tuomas Sandholm. Nonexistence of Voting Rules That Are Usually Hard to Manipulate. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), pp. 627-634, Boston, MA, USA, 2006. Keywords: voting, hardness of manipulation.

Naoki Ohta, Atsushi Iwasaki, Makoto Yokoo, Kohki Maruono, Vincent Conitzer, and Tuomas Sandholm. A Compact Representation Scheme for Coalitional Games in Open Anonymous Environments. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), pp. 697-702, Boston, MA, USA, 2006. Keywords: cooperative game theory, anonymity-proofness, collusion, core, nucleolus.

Vincent Conitzer and Nikesh Garera. Learning Algorithms for Online Principal-Agent Problems (and Selling Goods Online). In Proceedings of the 23rd International Conference on Machine Learning (ICML-06), pp. 209-216, Pittsburgh, Pennsylvania, USA, 2006. Keywords: learning in markets.

Vincent Conitzer and Tuomas Sandholm. A Technique for Reducing Normal-Form Games to Compute a Nash Equilibrium. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-06), pp. 537-544, Hakodate, Japan, 2006. One of four runners-up for the Best Student Paper Award. Keywords: noncooperative game theory, Nash equilibrium.

Vincent Conitzer and Tuomas Sandholm. Failures of the VCG Mechanism in Combinatorial Auctions and Exchanges. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-06), pp. 521-528, Hakodate, Japan, 2006. Keywords: combinatorial auctions and exchanges, mechanism design, collusion, VCG mechanism.


2005
Vincent Conitzer and Tuomas Sandholm. Communication Complexity of Common Voting Rules. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC-05), pp. 78-87, Vancouver, Canada, 2005. Keywords: voting, preference elicitation, communication complexity.

Vincent Conitzer and Tuomas Sandholm. Complexity of (Iterated) Dominance. In Proceedings of the 6th ACM Conference on Electronic Commerce (EC-05), pp. 88-97, Vancouver, Canada, 2005. Keywords: noncooperative game theory, dominance and iterated dominance.

Vincent Conitzer and Tuomas Sandholm. Common Voting Rules as Maximum Likelihood Estimators. In Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), pp. 145-152, Edinburgh, Scotland, UK, 2005. Keywords: voting, optimal voting rules.

Vincent Conitzer and Tuomas Sandholm. A Generalized Strategy Eliminability Criterion and Computational Methods for Applying It. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 483-488, Pittsburgh, Pennsylvania, USA, 2005. Keywords: noncooperative game theory, Nash equilibrium, dominance and iterated dominance, alternative solution concepts.

Vincent Conitzer and Tuomas Sandholm. Expressive Negotiation in Settings with Externalities. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 255-260, Pittsburgh, Pennsylvania, USA, 2005. Keywords: expressive markets, public goods, externalities, winner determination.

Vincent Conitzer, Tuomas Sandholm, and Paolo Santi. Combinatorial Auctions with k-wise Dependent Valuations. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 248-254, Pittsburgh, Pennsylvania, USA, 2005. Keywords: combinatorial auctions and exchanges, winner determination, preference elicitation.

Makoto Yokoo, Vincent Conitzer, Tuomas Sandholm, Naoki Ohta, and Atsushi Iwasaki. Coalitional Games in Open Anonymous Environments. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 509-514, Pittsburgh, Pennsylvania, USA, 2005. This paper was also presented at the 19th Annual Conference of the Japan Society for Artificial Intelligence (JSAI-05) where it was one of five Awarded Papers. Keywords: cooperative game theory, anonymity-proofness, collusion, core, nucleolus, Shapley value.

Tuomas Sandholm, Andrew Gilpin, and Vincent Conitzer. Mixed-Integer Programming Methods for Finding Nash Equilibria. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 495-501, Pittsburgh, Pennsylvania, USA, 2005. Keywords: noncooperative game theory, Nash equilibrium.

Vincent Conitzer. Computational Aspects of Mechanism Design. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05) (Doctoral Consortium), pp. 1642-1643, Pittsburgh, PA, USA, 2005. Keywords: overviews.


2004
Vincent Conitzer and Tuomas Sandholm. Expressive Negotiation over Donations to Charities. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), pp. 51-60, New York, NY, USA, 2004. Keywords: expressive markets, public goods, externalities, winner determination.

Vincent Conitzer and Tuomas Sandholm. Self-Interested Automated Mechanism Design and Implications for Optimal Combinatorial Auctions. In Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), pp. 132-141, New York, NY, USA, 2004. Keywords: mechanism design, automated mechanism design, combinatorial auctions and exchanges.

Vincent Conitzer and Tuomas Sandholm. Computing Shapley Values, Manipulating Value Division Schemes, and Checking Core Membership in Multi-Issue Domains. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), pp. 219-225, San Jose, California, USA, 2004. Keywords: cooperative game theory, core, Shapley value.

Vincent Conitzer, Jonathan Derryberry, and Tuomas Sandholm. Combinatorial Auctions with Structured Item Graphs. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-04), pp. 212-218, San Jose, California, USA, 2004. Keywords: combinatorial auctions and exchanges, winner determination.

Vincent Conitzer and Tuomas Sandholm. Communication Complexity as a Lower Bound for Learning in Games. In Proceedings of the 21st International Conference on Machine Learning (ICML-04), pp. 185-192, Banff, Alberta, Canada, 2004. Keywords: noncooperative game theory, learning in games, communication complexity, Nash equilibrium, dominance and iterated dominance, backward induction.

Vincent Conitzer and Tuomas Sandholm. An Algorithm for Automatically Designing Deterministic Mechanisms without Payments. In Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-04), pp. 128-135, New York, NY, USA, 2004. Keywords: mechanism design, automated mechanism design.

Paolo Santi, Vincent Conitzer, and Tuomas Sandholm. Towards a Characterization of Polynomial Preference Elicitation with Value Queries in Combinatorial Auctions. In Proceedings of the 17th Annual Conference on Learning Theory (COLT-04), pp. 1-16, Banff, Alberta, Canada, 2004. Keywords: combinatorial auctions and exchanges, preference elicitation.

Vincent Conitzer and Tuomas Sandholm. Computational Criticisms of the Revelation Principle. Short paper in Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), pp. 262-263, New York, NY, USA, 2004. Also presented orally at the Conference on Logic and the Foundations of Game and Decision Theory (LOFT-04), Leipzig, Germany, 2004. Keywords: mechanism design, hardness of manipulation.


2003
Vincent Conitzer and Tuomas Sandholm. Complexity Results about Nash Equilibria. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 765-771, Acapulco, Mexico, 2003. See journal version above. Keywords: noncooperative game theory, Nash equilibrium.

Vincent Conitzer and Tuomas Sandholm. Universal Voting Protocol Tweaks to Make Manipulation Hard. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 781-788, Acapulco, Mexico, 2003. Keywords: voting, hardness of manipulation.

Vincent Conitzer and Tuomas Sandholm. Definition and Complexity of Some Basic Metareasoning Problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 1099-1106, Acapulco, Mexico, 2003. Keywords: resource-bounded reasoning.

Vincent Conitzer and Tuomas Sandholm. Complexity of Determining Nonemptiness of the Core. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 613-618, Acapulco, Mexico, 2003. See journal version above. Keywords: cooperative game theory, core.

Vincent Conitzer and Tuomas Sandholm. AWESOME: A General Multiagent Learning Algorithm that Converges in Self-Play and Learns a Best Response Against Stationary Opponents. In Proceedings of the 20th International Conference on Machine Learning (ICML-03), pp. 83-90, Washington, DC, USA, 2003. See journal version above. Keywords: noncooperative game theory, learning in games, Nash equilibrium.

Vincent Conitzer and Tuomas Sandholm. BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games. In Proceedings of the 20th International Conference on Machine Learning (ICML-03), pp. 91-98, Washington, DC, USA, 2003. Keywords: noncooperative game theory, learning in games, zero-sum games.

Vincent Conitzer, Jérôme Lang, and Tuomas Sandholm. How Many Candidates Are Needed to Make Elections Hard to Manipulate? In Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-03), pp. 201-214, Bloomington, Indiana, USA, 2003. See journal version above. Keywords: voting, hardness of manipulation.

Vincent Conitzer and Tuomas Sandholm. Automated Mechanism Design: Complexity Results Stemming from the Single-Agent Setting. In Proceedings of the 5th International Conference on Electronic Commerce (ICEC-03), pp. 17-24, Pittsburgh, PA, USA, 2003. Keywords: mechanism design, automated mechanism design.

Vincent Conitzer and Tuomas Sandholm. Applications of Automated Mechanism Design. Early version: the UAI-03 Bayesian Modeling Applications Workshop, Acapulco, Mexico, 2003. Keywords: mechanism design, automated mechanism design.

Vincent Conitzer and Tuomas Sandholm. Automated Mechanism Design with a Structured Outcome Space. Draft, 2003. Keywords: mechanism design, automated mechanism design.


2002
Vincent Conitzer and Tuomas Sandholm. Complexity of Mechanism Design. In Proceedings of the 18th Annual Conference on Uncertainty in Artificial Intelligence (UAI-02), pp. 103-110, Edmonton, Canada, 2002. Keywords: mechanism design, automated mechanism design.

Vincent Conitzer and Tuomas Sandholm. Complexity of Manipulating Elections with Few Candidates. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), pp. 314-319, Edmonton, Canada, 2002. See journal version above. Keywords: voting, hardness of manipulation.

Vincent Conitzer and Tuomas Sandholm. Vote Elicitation: Complexity and Strategy-Proofness. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), pp. 392-397, Edmonton, Canada, 2002. Keywords: voting, preference elicitation.
MISCELLANEOUS
Tutorial: Automated Mechanism Design: Approaches and Applications (ppt (my slides only), pdf (also including Eugene's slides)). Given at EC-08 with Yevgeniy (Eugene) Vorobeychik.

Attracting Students to Computer Science Using Artificial Intelligence, Economics, and Linear Programming (.ppt, .pdf). (Invited talk at the 2008 AAAI Spring Symposium on Using AI to Motivate Greater Participation in Computer Science.)

Tutorial: Mechanism Design for Multiagent Systems (.ppt, .pdf). Given at the Dubai Agents & Multi-Agent Systems School 2008, and an earlier version at NESCAI 2006.

A game-theoretically optimal computer player for a class of Liar's Dice games (source code). Let me know if you find bugs/have comments. (Apologies for the archaic text-based interface...)

A puzzle - let me know if you solve it. Here are some hints, as well as the first few steps of the solution, and even a translation into French by Dany Bergeron. (For more puzzles, see SIGecom Exchanges.)

A 5-line integer program formulation for Sudoku in GMPL, the modeling language for GLPK (GNU Linear Programming Kit). (I'm certainly not the first to come up with such a formulation, e.g. here.) The example puzzle is from Wikipedia's Sudoku page (and solves in 0.0 seconds).
HUMOR
Mike Shor's humor page + funny incentives in soccer.
Sergiu Hart's humor page.
Videos that I find funny:
Funny game show answers: Who Wants to Be a Millionaire? (French version), Family Feud, Are You Smarter Than a Fifth Grader?, a variety of funny answers.
Other: Love Two Point Oh.