| Publication | Date of Publication | Type |
|---|
| Strategic voting and strategic candidacy | 2024-11-13 | Paper |
| A Theory of Bounded Inductive Rationality | 2024-02-28 | Paper |
| Minimum-regret contracts for principal-expert problems | 2023-03-21 | Paper |
| Bayesian repeated zero-sum games with persistent state, with application to security games | 2023-03-21 | Paper |
| Welfare-preserving \(\varepsilon \)-BIC to BIC transformation with negligible revenue loss | 2022-07-06 | Paper |
| Multiplicative Pacing Equilibria in Auction Markets | 2022-05-31 | Paper |
| Barriers to Manipulation in Voting | 2020-11-12 | Paper |
| Introduction to Computational Social Choice | 2020-11-12 | Paper |
| Crying about a strategic wolf: a theory of crime and warning | 2020-11-11 | Paper |
| The Exact Computational Complexity of Evolutionarily Stable Strategies | 2020-04-30 | Paper |
| Adapting a kidney exchange algorithm to align with human values | 2020-04-21 | Paper |
| Game-Theoretic Question Selection for Tests | 2017-10-24 | Paper |
| Justified representation in approval-based committee voting | 2017-05-23 | Paper |
| On Stackelberg mixed strategies | 2017-03-14 | Paper |
| A Dutch book against sleeping beauties who are evidential decision theorists | 2017-03-09 | Paper |
| Can rational choice guide us to correct \textit{de se} beliefs? | 2017-03-08 | Paper |
| Computing Equilibria with Partial Commitment | 2017-02-10 | Paper |
| Timeability of extensive-form games | 2016-04-15 | Paper |
| The Exact Computational Complexity of Evolutionarily Stable Strategies | 2015-01-12 | Paper |
| Better redistribution with inefficient allocation in multi-unit auctions | 2014-10-13 | Paper |
| False-name-proof voting with costs over two alternatives | 2014-08-29 | Paper |
| Strategy-proof contract auctions and the role of ties | 2014-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417648 | 2014-05-22 | Paper |
| Undominated Groves Mechanisms | 2013-02-25 | Paper |
| Should social network structure be taken into account in elections? | 2012-09-11 | Paper |
| Stackelberg versus Nash in security games: Interchangeability, equivalence, and uniqueness | 2012-06-27 | Paper |
| Computing optimal outcomes under an expressive representation of settings with externalities | 2012-05-11 | Paper |
| Choosing fair lotteries to defeat the competition | 2012-02-22 | Paper |
| Expressive markets for donating to charities | 2011-11-17 | Paper |
| Stackelberg vs. Nash in Security Games: An Extended Investigation of Interchangeability, Equivalence, and Uniqueness | 2011-06-23 | Paper |
| Determining Possible and Necessary Winners Given Partial Orders | 2011-06-16 | Paper |
| Comparing multiagent systems research in combinatorial auctions and voting | 2011-01-12 | Paper |
| Optimal-in-expectation redistribution mechanisms | 2010-05-07 | Paper |
| Eliciting single-peaked preferences using comparison queries | 2009-12-10 | Paper |
| Learning and approximating the optimal strategy to commit to | 2009-12-01 | Paper |
| Worst-case optimal redistribution of VCG payments in multi-unit auctions | 2009-08-27 | 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 |
| 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 |
| Learning Theory | 2005-06-13 | Paper |
