| Publication | Date of Publication | Type |
|---|
Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Strong Nash equilibria and mixed strategies
International Journal of Game Theory | 2021-04-27 | Paper |
Ignorance is almost bliss: near-optimal stochastic matching with few queries
Operations Research | 2020-11-04 | Paper |
Ignorance is almost bliss: near-optimal stochastic matching with few queries
Operations Research | 2020-11-04 | Paper |
Limited lookahead in imperfect-information games
Artificial Intelligence | 2020-04-21 | Paper |
Superhuman AI for multiplayer poker
Science | 2020-03-04 | Paper |
Faster algorithms for extensive-form game solving via improved smoothing functions
Mathematical Programming. Series A. Series B | 2020-01-17 | Paper |
Superhuman AI for heads-up no-limit poker: Libratus beats top professionals
Science | 2019-07-03 | Paper |
Efficiency and budget balance in general quasi-linear domains
Games and Economic Behavior | 2019-03-29 | Paper |
Efficiency and Budget Balance
Web and Internet Economics | 2017-02-10 | Paper |
Automated design of revenue-maximizing combinatorial auctions
Operations Research | 2016-03-22 | Paper |
Online algorithms for market clearing
Journal of the ACM | 2015-12-04 | Paper |
The Gates-Hillman prediction market
Review of Economic Design | 2013-06-25 | Paper |
First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
Information-theoretic approaches to branching in search
Discrete Optimization | 2012-06-20 | Paper |
Computing optimal outcomes under an expressive representation of settings with externalities
Journal of Computer and System Sciences | 2012-05-11 | Paper |
Expressive markets for donating to charities
Artificial Intelligence | 2011-11-17 | Paper |
| Preference elicitation and query learning | 2011-10-12 | Paper |
Smoothing techniques for computing Nash equilibria of sequential games
Mathematics of Operations Research | 2011-04-27 | Paper |
Algorithms for closed under rational behavior (CURB) sets
Journal of Artificial Intelligence Research | 2010-09-09 | Paper |
Learning Theory and Kernel Machines
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Automated mechanism design: a new application area for search algorithms
Lecture Notes in Computer Science | 2010-03-02 | Paper |
Better with Byzantine: manipulation-optimal mechanisms
Algorithmic Game Theory | 2009-12-01 | Paper |
Perspectives on multiagent learning
Artificial Intelligence | 2009-07-09 | Paper |
A New Solution Concept for Coalitional Games in Open Anonymous Environments
New Frontiers in Artificial Intelligence | 2009-03-26 | Paper |
Lossless abstraction of imperfect information games
Journal of the ACM | 2008-12-21 | Paper |
When are elections with few candidates hard to manipulate?
Journal of the ACM | 2008-12-21 | Paper |
New complexity results about Nash equilibria
Games and Economic Behavior | 2008-07-11 | Paper |
Complexity of constructing solutions in the core based on synergies among coalitions
Artificial Intelligence | 2007-10-23 | Paper |
AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
Machine Learning | 2007-09-20 | Paper |
Side constraints and non-price attributes in markets
Games and Economic Behavior | 2006-09-28 | Paper |
BOB: Improved winner determination in combinatorial auctions and generalizations
Artificial Intelligence | 2006-02-07 | Paper |
Financial Cryptography and Data Security
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
| scientific article; zbMATH DE number 2119762 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 1979533 (Why is no real title available?) | 2003-09-14 | Paper |
Compressing two-dimensional routing tables
Algorithmica | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1966906 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1966908 (Why is no real title available?) | 2003-08-18 | Paper |
Anytime coalition structure generation: an average case study
Journal of Experimental & Theoretical Artificial Intelligence | 2002-11-27 | Paper |
Coalition structure generation with worst case guarantees
Artificial Intelligence | 2002-07-24 | Paper |
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence | 2002-03-03 | Paper |
Bargaining with limited computation: Deliberation equilibrium
Artificial Intelligence | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1617280 (Why is no real title available?) | 2001-07-11 | Paper |
Coalition formation processes with belief revision among bounded-rational self-interested agents
Journal Of Logic And Computation | 2001-06-27 | Paper |
Leveled commitment contracts and strategic breach
Games and Economic Behavior | 2001-01-01 | Paper |
Leveled commitment contracts with myopic and strategic agents
Journal of Economic Dynamics and Control | 2000-10-26 | Paper |
Coalitions among computationally bounded agents
Artificial Intelligence | 1998-07-22 | Paper |
