This page is automatically constructed from my home page. Please let me know if you would like the code that I wrote for this.

Please note that many publications are listed under multiple categories.

Topics: alternative solution concepts, anonymity-proofness, automated mechanism design, backward induction, collusion, combinatorial auctions and exchanges, commitment, communication complexity, computational biology, cooperative game theory, core, dominance and iterated dominance, edited volumes, expressive markets, externalities, games with a purpose, hardness of control, hardness of manipulation, learning in games, learning in markets, mechanism design, Nash equilibrium, noncooperative game theory, nucleolus, optimal voting rules, overviews, prediction markets, preference elicitation, public goods, resource-bounded reasoning, revenue redistribution, Shapley value, single-peaked preferences, Turing tests, VCG mechanism, voting, voting in combinatorial domains, winner determination, zero-sum games.


alternative solution concepts
Joshua Letchford, Vincent Conitzer, and Kamal Jain. An "Ethical" Game-Theoretic Solution Concept for Two-Player Perfect-Information Games. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 696-707, Shanghai, China, 2008. Full version with appendices. Keywords: noncooperative game theory, alternative solution concepts.

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.


anonymity-proofness
Vincent Conitzer. Anonymity-Proof Voting Rules. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 295-306, Shanghai, China, 2008. Keywords: anonymity-proofness, voting, mechanism design.

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.

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

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.

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.


automated mechanism design
Mingyu Guo, Vincent Conitzer, and Daniel Reeves. Competitive Repeated Allocation Without Payments. In the Fifth Workshop on Internet and Network Economics (WINE-09), Rome, Italy, 2009. Keywords: mechanism design, automated mechanism design.

Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. Games and Economic Behavior, Special Section Dedicated to the 8th ACM Conference on Electronic Commerce, Volume 67, Issue 1, 2009, pp. 69-98. Earlier version appeared 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.

Krzysztof Apt, Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. Welfare Undominated Groves Mechanisms. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 426-437, Shanghai, China, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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. See journal version above. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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

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.

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.


backward induction
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.


collusion
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.

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

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.


combinatorial auctions and exchanges
Vincent Conitzer. Making Decisions Based on the Preferences of Multiple Agents. To appear in the Communications of the ACM (CACM), June 2010. Keywords: voting, combinatorial auctions and exchanges, expressive markets, prediction markets, mechanism design.

Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, and Lirong Xia. Incentive Compatible Budget Elicitation in Multi-unit Auctions. To appear in the ACM-SIAM Symposium on Discrete Algorithms (SODA-10), Austin, TX, USA, 2010. Keywords: combinatorial auctions and exchanges, mechanism design.

B. Paul Harrenstein, Mathijs M. de Weerdt, and Vincent Conitzer. A Qualitative Vickrey Auction. In Proceedings of the Tenth ACM Conference on Electronic Commerce (EC-09), pp. 197-206, Stanford, CA, USA, 2009. Keywords: combinatorial auctions and exchanges, expressive markets, mechanism design.

Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. Games and Economic Behavior, Special Section Dedicated to the 8th ACM Conference on Electronic Commerce, Volume 67, Issue 1, 2009, pp. 69-98. Earlier version appeared 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. Auction Protocols. Chapter to appear in the CRC Algorithms and Theory of Computation Handbook. Keywords: combinatorial auctions and exchanges, overviews.

Krzysztof Apt, Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. Welfare Undominated Groves Mechanisms. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 426-437, Shanghai, China, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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

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. See journal version above. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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

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.


commitment
Joshua Letchford, Vincent Conitzer, and Kamesh Munagala. Learning and Approximating the Optimal Strategy to Commit To. In the Second International Symposium on Algorithmic Game Theory (SAGT-09), pp. 250-262, Paphos, Cyprus, 2009. Full version with appendices. Keywords: noncooperative game theory, commitment.

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.


communication complexity
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. 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.


computational biology
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, voting, optimal voting rules.


cooperative game theory
Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko Sakurai, Atsushi Iwasaki, and Makoto Yokoo. Coalition Structure Generation Utilizing Compact Characteristic Function Representations. In the Fifteenth International Conference on Principles and Practice of Constraint Programming (CP-09), pp. 623-638, Lisbon, Portugal, 2009. Keywords: cooperative game theory.

Vincent Conitzer. Prediction Markets, Mechanism Design, and Cooperative Game Theory. To appear in the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI-09), Montreal, Canada, 2009. Keywords: prediction markets, mechanism design, cooperative game theory.

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

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.

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.

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


core
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.

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.

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.

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


dominance and iterated dominance
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. 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. 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.


edited volumes
SIGecom Exchanges Volume 8.1. Contributed Introduction and Editor's Puzzle: Identifying the Champion. Keywords: edited volumes.

SIGecom Exchanges Volume 7.3. Contributed Introduction and Editor's Puzzle: Product Adoption in a Social Network. Keywords: edited volumes.

SIGecom Exchanges Volume 7.2. Contributed Introduction and Editor's Puzzle: Strategically Choosing Products to Release. Keywords: edited volumes.

SIGecom Exchanges Volume 7.1. Contributed Introduction and Editor's Puzzle: Combinatorial Auction Winner Determination. Keywords: edited volumes.


expressive markets
Vincent Conitzer. Making Decisions Based on the Preferences of Multiple Agents. To appear in the Communications of the ACM (CACM), June 2010. Keywords: voting, combinatorial auctions and exchanges, expressive markets, prediction markets, mechanism design.

B. Paul Harrenstein, Mathijs M. de Weerdt, and Vincent Conitzer. A Qualitative Vickrey Auction. In Proceedings of the Tenth ACM Conference on Electronic Commerce (EC-09), pp. 197-206, Stanford, CA, USA, 2009. Keywords: combinatorial auctions and exchanges, expressive markets, mechanism design.

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


externalities
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 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.


games with a purpose
Joseph Farfel and Vincent Conitzer. Turing Trade: A hybrid of a Turing test and a prediction market. In Proceedings of The First Conference on Auctions, Market Mechanisms, and Their Applications (AMMA-09), pp. 61-73, Boston, MA, USA, 2009. A demo version at AAMAS 2009 appears as A Multiagent Turing Test Based on a Prediction Market (Extended Abstract), pp. 1407-1408. Keywords: prediction markets, Turing tests, games with a purpose.


hardness of control
Vincent Conitzer, Jérôme Lang, and Lirong Xia. How hard is it to control sequential elections via the agenda? In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 103-108, Pasadena, CA, USA, 2009. Keywords: voting, voting in combinatorial domains, hardness of control.


hardness of manipulation
Lirong Xia, Michael Zuckerman, Ariel D. Procaccia, Vincent Conitzer, and Jeffrey Rosenschein. Complexity of Unweighted Coalitional Manipulation Under Some Common Voting Rules. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 348-353, Pasadena, CA, USA, 2009. Keywords: voting, hardness of manipulation.

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.

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.

Vincent Conitzer, Tuomas Sandholm, and Jérôme Lang. When Are Elections with Few Candidates Hard to Manipulate? Journal of the ACM (JACM), Volume 54, Issue 3, June 2007, Article 14 (33 pages). 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.

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.

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.

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.

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


learning in games
Vincent Conitzer. Approximation Guarantees for Fictitious Play. To appear in the Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton-09), Allerton Retreat Center, Monticello, IL, USA, 2009. Keywords: noncooperative game theory, learning in games, Nash equilibrium.

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.

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


learning in markets
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.


mechanism design
Vincent Conitzer. Making Decisions Based on the Preferences of Multiple Agents. To appear in the Communications of the ACM (CACM), June 2010. Keywords: voting, combinatorial auctions and exchanges, expressive markets, prediction markets, mechanism design.

Sayan Bhattacharya, Vincent Conitzer, Kamesh Munagala, and Lirong Xia. Incentive Compatible Budget Elicitation in Multi-unit Auctions. To appear in the ACM-SIAM Symposium on Discrete Algorithms (SODA-10), Austin, TX, USA, 2010. Keywords: combinatorial auctions and exchanges, mechanism design.

Joseph Farfel and Vincent Conitzer. Aggregating Value Ranges: Preference Elicitation and Truthfulness. To appear in the Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), Special Issue on Social Choice. Keywords: voting, preference elicitation, single-peaked preferences, mechanism design.

Mingyu Guo, Vincent Conitzer, and Daniel Reeves. Competitive Repeated Allocation Without Payments. In the Fifth Workshop on Internet and Network Economics (WINE-09), Rome, Italy, 2009. Keywords: mechanism design, automated mechanism design.

Vincent Conitzer. Prediction Markets, Mechanism Design, and Cooperative Game Theory. To appear in the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI-09), Montreal, Canada, 2009. Keywords: prediction markets, mechanism design, cooperative game theory.

B. Paul Harrenstein, Mathijs M. de Weerdt, and Vincent Conitzer. A Qualitative Vickrey Auction. In Proceedings of the Tenth ACM Conference on Electronic Commerce (EC-09), pp. 197-206, Stanford, CA, USA, 2009. Keywords: combinatorial auctions and exchanges, expressive markets, mechanism design.

Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. Games and Economic Behavior, Special Section Dedicated to the 8th ACM Conference on Electronic Commerce, Volume 67, Issue 1, 2009, pp. 69-98. Earlier version appeared 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. Anonymity-Proof Voting Rules. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 295-306, Shanghai, China, 2008. Keywords: anonymity-proofness, voting, mechanism design.

Krzysztof Apt, Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. Welfare Undominated Groves Mechanisms. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 426-437, Shanghai, China, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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.

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.

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. See journal version above. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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

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

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.

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.

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.


Nash equilibrium
Vincent Conitzer. Approximation Guarantees for Fictitious Play. To appear in the Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton-09), Allerton Retreat Center, Monticello, IL, USA, 2009. Keywords: noncooperative game theory, learning in games, Nash equilibrium.

Vincent Conitzer and Tuomas Sandholm. New Complexity Results about Nash Equilibria. Games and Economic Behavior, Special Issue on the Second World Congress of the Game Theory Society, Volume 63, Issue 2, 2008, pp. 621-641. Earlier version appeared in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 765-771, Acapulco, Mexico, 2003. Keywords: noncooperative game theory, Nash equilibrium.

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.

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.

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

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


noncooperative game theory
Joshua Letchford, Vincent Conitzer, and Kamesh Munagala. Learning and Approximating the Optimal Strategy to Commit To. In the Second International Symposium on Algorithmic Game Theory (SAGT-09), pp. 250-262, Paphos, Cyprus, 2009. Full version with appendices. Keywords: noncooperative game theory, commitment.

Vincent Conitzer. Approximation Guarantees for Fictitious Play. To appear in the Proceedings of the 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton-09), Allerton Retreat Center, Monticello, IL, USA, 2009. Keywords: noncooperative game theory, learning in games, Nash equilibrium.

Erik Halvorson, Vincent Conitzer, and Ronald Parr. Multi-step Multi-sensor Hider-Seeker Games. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 159-166, Pasadena, CA, USA, 2009. Keywords: noncooperative game theory, zero-sum games.

Joshua Letchford, Vincent Conitzer, and Kamal Jain. An "Ethical" Game-Theoretic Solution Concept for Two-Player Perfect-Information Games. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 696-707, Shanghai, China, 2008. Full version with appendices. Keywords: noncooperative game theory, alternative solution concepts.

Vincent Conitzer and Tuomas Sandholm. New Complexity Results about Nash Equilibria. Games and Economic Behavior, Special Issue on the Second World Congress of the Game Theory Society, Volume 63, Issue 2, 2008, pp. 621-641. Earlier version appeared in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 765-771, Acapulco, Mexico, 2003. Keywords: noncooperative game theory, Nash equilibrium.

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.

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.

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

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


nucleolus
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.

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.


optimal voting rules
Vincent Conitzer, Matthew Rognlie, and Lirong Xia. Preference Functions That Score Rankings and Maximum Likelihood Estimation. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 109-115, Pasadena, CA, USA, 2009. Keywords: voting, optimal voting rules.

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, voting, optimal voting rules.

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.


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


prediction markets
Vincent Conitzer. Making Decisions Based on the Preferences of Multiple Agents. To appear in the Communications of the ACM (CACM), June 2010. Keywords: voting, combinatorial auctions and exchanges, expressive markets, prediction markets, mechanism design.

Peng Shi, Vincent Conitzer, and Mingyu Guo. Prediction Mechanisms That Do Not Incentivize Undesirable Actions. In the Fifth Workshop on Internet and Network Economics (WINE-09), Rome, Italy, 2009. Keywords: prediction markets.

Vincent Conitzer. Prediction Markets, Mechanism Design, and Cooperative Game Theory. To appear in the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI-09), Montreal, Canada, 2009. Keywords: prediction markets, mechanism design, cooperative game theory.

Joseph Farfel and Vincent Conitzer. Turing Trade: A hybrid of a Turing test and a prediction market. In Proceedings of The First Conference on Auctions, Market Mechanisms, and Their Applications (AMMA-09), pp. 61-73, Boston, MA, USA, 2009. A demo version at AAMAS 2009 appears as A Multiagent Turing Test Based on a Prediction Market (Extended Abstract), pp. 1407-1408. Keywords: prediction markets, Turing tests, games with a purpose.


preference elicitation
Joseph Farfel and Vincent Conitzer. Aggregating Value Ranges: Preference Elicitation and Truthfulness. To appear in the Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), Special Issue on Social Choice. Keywords: voting, preference elicitation, single-peaked preferences, mechanism design.

Vincent Conitzer. Eliciting Single-Peaked Preferences Using Comparison Queries. Journal of Artificial Intelligence Research (JAIR), Volume 35, 2009, pp. 161-191. Earlier version appeared 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.

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.

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. See journal version above. Keywords: voting, preference elicitation, single-peaked preferences.

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

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


public goods
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 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.


resource-bounded reasoning
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.

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.


revenue redistribution
Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. Games and Economic Behavior, Special Section Dedicated to the 8th ACM Conference on Electronic Commerce, Volume 67, Issue 1, 2009, pp. 69-98. Earlier version appeared 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.

Krzysztof Apt, Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. Welfare Undominated Groves Mechanisms. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 426-437, Shanghai, China, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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. See journal version above. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.


Shapley value
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.

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.

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.


single-peaked preferences
Joseph Farfel and Vincent Conitzer. Aggregating Value Ranges: Preference Elicitation and Truthfulness. To appear in the Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), Special Issue on Social Choice. Keywords: voting, preference elicitation, single-peaked preferences, mechanism design.

Vincent Conitzer. Eliciting Single-Peaked Preferences Using Comparison Queries. Journal of Artificial Intelligence Research (JAIR), Volume 35, 2009, pp. 161-191. Earlier version appeared 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. 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. See journal version above. Keywords: voting, preference elicitation, single-peaked preferences.


Turing tests
Joseph Farfel and Vincent Conitzer. Turing Trade: A hybrid of a Turing test and a prediction market. In Proceedings of The First Conference on Auctions, Market Mechanisms, and Their Applications (AMMA-09), pp. 61-73, Boston, MA, USA, 2009. A demo version at AAMAS 2009 appears as A Multiagent Turing Test Based on a Prediction Market (Extended Abstract), pp. 1407-1408. Keywords: prediction markets, Turing tests, games with a purpose.


VCG mechanism
Mingyu Guo and Vincent Conitzer. Worst-Case Optimal Redistribution of VCG Payments in Multi-Unit Auctions. Games and Economic Behavior, Special Section Dedicated to the 8th ACM Conference on Electronic Commerce, Volume 67, Issue 1, 2009, pp. 69-98. Earlier version appeared 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.

Krzysztof Apt, Vincent Conitzer, Mingyu Guo, and Evangelos Markakis. Welfare Undominated Groves Mechanisms. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 426-437, Shanghai, China, 2008. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.

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. See journal version above. Keywords: mechanism design, automated mechanism design, VCG mechanism, revenue redistribution, combinatorial auctions and exchanges.

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.

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.


voting
Vincent Conitzer. Making Decisions Based on the Preferences of Multiple Agents. To appear in the Communications of the ACM (CACM), June 2010. Keywords: voting, combinatorial auctions and exchanges, expressive markets, prediction markets, mechanism design.

Joseph Farfel and Vincent Conitzer. Aggregating Value Ranges: Preference Elicitation and Truthfulness. To appear in the Journal of Autonomous Agents and Multi-Agent Systems (JAAMAS), Special Issue on Social Choice. Keywords: voting, preference elicitation, single-peaked preferences, mechanism design.

Vincent Conitzer, Matthew Rognlie, and Lirong Xia. Preference Functions That Score Rankings and Maximum Likelihood Estimation. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 109-115, Pasadena, CA, USA, 2009. Keywords: voting, optimal voting rules.

Vincent Conitzer, Jérôme Lang, and Lirong Xia. How hard is it to control sequential elections via the agenda? In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 103-108, Pasadena, CA, USA, 2009. Keywords: voting, voting in combinatorial domains, hardness of control.

Lirong Xia and Vincent Conitzer. Finite Local Consistency Characterizes Generalized Scoring Rules. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 336-341, Pasadena, CA, USA, 2009. Keywords: voting.

Lirong Xia, Michael Zuckerman, Ariel D. Procaccia, Vincent Conitzer, and Jeffrey Rosenschein. Complexity of Unweighted Coalitional Manipulation Under Some Common Voting Rules. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 348-353, Pasadena, CA, USA, 2009. Keywords: voting, hardness of manipulation.

Vincent Conitzer. Eliciting Single-Peaked Preferences Using Comparison Queries. Journal of Artificial Intelligence Research (JAIR), Volume 35, 2009, pp. 161-191. Earlier version appeared 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. Anonymity-Proof Voting Rules. In Proceedings of the Fourth Workshop on Internet and Network Economics (WINE-08), pp. 295-306, Shanghai, China, 2008. Keywords: anonymity-proofness, voting, mechanism design.

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.

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

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, voting, optimal voting rules.

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 (JACM), Volume 54, Issue 3, June 2007, Article 14 (33 pages). 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.

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. See journal version above. 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.

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.

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


voting in combinatorial domains
Vincent Conitzer, Jérôme Lang, and Lirong Xia. How hard is it to control sequential elections via the agenda? In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 103-108, Pasadena, CA, USA, 2009. Keywords: voting, voting in combinatorial domains, hardness of control.

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.


winner determination
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.

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

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


zero-sum games
Erik Halvorson, Vincent Conitzer, and Ronald Parr. Multi-step Multi-sensor Hider-Seeker Games. In the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 159-166, Pasadena, CA, USA, 2009. Keywords: noncooperative game theory, zero-sum games.

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.