| Publication | Date of Publication | Type |
|---|
| Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games | 2023-12-08 | Paper |
| How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design | 2023-11-14 | Paper |
| Strong Nash equilibria and mixed strategies | 2021-04-27 | Paper |
| Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries | 2020-11-04 | Paper |
| Limited lookahead in imperfect-information games | 2020-04-21 | Paper |
| Superhuman AI for multiplayer poker | 2020-03-04 | Paper |
| Faster algorithms for extensive-form game solving via improved smoothing functions | 2020-01-17 | Paper |
| Superhuman AI for heads-up no-limit poker: Libratus beats top professionals | 2019-07-03 | Paper |
| Efficiency and budget balance in general quasi-linear domains | 2019-03-29 | Paper |
| Efficiency and Budget Balance | 2017-02-10 | Paper |
| Automated Design of Revenue-Maximizing Combinatorial Auctions | 2016-03-22 | Paper |
| Online algorithms for market clearing | 2015-12-04 | Paper |
| The Gates-Hillman prediction market | 2013-06-25 | Paper |
| First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games | 2012-06-26 | Paper |
| Information-theoretic approaches to branching in search | 2012-06-20 | Paper |
| Computing optimal outcomes under an expressive representation of settings with externalities | 2012-05-11 | Paper |
| Expressive markets for donating to charities | 2011-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093198 | 2011-10-12 | Paper |
| Smoothing Techniques for Computing Nash Equilibria of Sequential Games | 2011-04-27 | Paper |
| Algorithms for Closed Under Rational Behavior (CURB) Sets | 2010-09-09 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Principles and Practice of Constraint Programming – CP 2003 | 2010-03-02 | Paper |
| Better with Byzantine: Manipulation-Optimal Mechanisms | 2009-12-01 | Paper |
| Perspectives on multiagent learning | 2009-07-09 | Paper |
| A New Solution Concept for Coalitional Games in Open Anonymous Environments | 2009-03-26 | Paper |
| When are elections with few candidates hard to manipulate? | 2008-12-21 | Paper |
| Lossless abstraction of imperfect information games | 2008-12-21 | Paper |
| New complexity results about Nash equilibria | 2008-07-11 | Paper |
| Complexity of constructing solutions in the core based on synergies among coalitions | 2007-10-23 | Paper |
| AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents | 2007-09-20 | Paper |
| Side constraints and non-price attributes in markets | 2006-09-28 | Paper |
| BOB: Improved winner determination in combinatorial auctions and generalizations | 2006-02-07 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4829037 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4427880 | 2003-09-14 | Paper |
| Compressing two-dimensional routing tables | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420996 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420998 | 2003-08-18 | Paper |
| Anytime coalition structure generation: an average case study | 2002-11-27 | Paper |
| Coalition structure generation with worst case guarantees | 2002-07-24 | Paper |
| Algorithm for optimal winner determination in combinatorial auctions | 2002-03-03 | Paper |
| Bargaining with limited computation: Deliberation equilibrium | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722003 | 2001-07-11 | Paper |
| Coalition formation processes with belief revision among bounded-rational self-interested agents | 2001-06-27 | Paper |
| Leveled commitment contracts and strategic breach | 2001-01-01 | Paper |
| Leveled commitment contracts with myopic and strategic agents | 2000-10-26 | Paper |
| Coalitions among computationally bounded agents | 1998-07-22 | Paper |
