| Publication | Date of Publication | Type |
|---|
| SDYN-GANs: adversarial learning methods for multistep generative models for general order stochastic dynamics | 2024-11-15 | Paper |
| Equilibrium computation, deep learning, and multi-agent reinforcement learning (invited talk) | 2024-06-24 | Paper |
| Sequential Mechanisms with Ex Post Individual Rationality | 2024-02-26 | Paper |
| Fast rates for nonparametric online learning: from realizability to learning in games | 2023-12-08 | Paper |
| Near-optimal no-regret learning for correlated equilibria in multi-player general-sum games | 2023-12-08 | Paper |
| The complexity of constrained min-max optimization | 2023-11-14 | Paper |
| Learning Ising models from one or multiple samples | 2023-11-14 | Paper |
| Sample-optimal and efficient learning of tree Ising models | 2023-11-14 | Paper |
| Multi-Item Nontruthful Auctions Achieve Good Revenue | 2023-04-04 | Paper |
| Learning and Testing Latent-Tree Ising Models Efficiently | 2022-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090401 | 2022-07-18 | Paper |
| Learning in auctions: regret is hard, envy is easy | 2022-07-15 | Paper |
| What Makes A Good Fisherman? Linear Regression under Self-Selection Bias | 2022-05-06 | Paper |
| A Statistical Taylor Theorem and Extrapolation of Truncated Densities | 2021-06-30 | Paper |
| EQUILIBRIA, FIXED POINTS, AND COMPUTATIONAL COMPLEXITY - NEVANLINNA PRIZE LECTURE | 2020-09-22 | Paper |
| Optimal Stopping Rules for Sequential Hypothesis Testing | 2020-05-27 | Paper |
| Regression from dependent observations | 2020-01-30 | Paper |
| Testing Ising Models | 2020-01-28 | Paper |
| A converse to Banach's fixed point theorem and its CLS-completeness | 2019-08-22 | Paper |
| A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage | 2019-06-20 | Paper |
| The Complexity of Optimal Mechanism Design | 2019-06-20 | Paper |
| Optimal and Efficient Parametric Auctions | 2019-05-15 | Paper |
| Testing k-Modal Distributions: Optimal Algorithms via Reductions | 2019-05-15 | Paper |
| Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations | 2019-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743483 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633883 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633848 | 2019-05-06 | Paper |
| Strong Duality for a Multiple-Good Monopolist | 2019-02-01 | Paper |
| Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract) | 2018-07-16 | Paper |
| Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization | 2018-07-11 | Paper |
| Testing Ising Models | 2018-03-15 | Paper |
| The Complexity of Hex and the Jordan Curve Theorem | 2017-12-19 | Paper |
| Concentration of Multilinear Functions of the Ising Model with Applications to Network Data | 2017-10-11 | Paper |
| Testing Poisson Binomial Distributions | 2017-10-05 | Paper |
| Bayesian Truthful Mechanisms for Job Scheduling from Bi-criterion Approximation Algorithms | 2017-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365040 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365135 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365081 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365039 | 2017-09-29 | Paper |
| A size-free CLT for poisson multinomials and its applications | 2017-09-29 | Paper |
| Message-Passing Algorithms and Improved LP Decoding | 2017-06-08 | Paper |
| Square Hellinger Subadditivity for Bayesian Networks and its Applications to Identity Testing | 2016-12-09 | Paper |
| How good is the Chord algorithm? | 2016-07-04 | Paper |
| Zero-sum polymatrix games: a generalization of minmax | 2016-05-19 | Paper |
| Sparse covers for sums of indicators | 2015-09-14 | Paper |
| Extreme value theorems for optimal multidimensional pricing | 2015-08-12 | Paper |
| Near-optimal no-regret algorithms for zero-sum games | 2015-08-12 | Paper |
| Species Trees are Recoverable from Unrooted Gene Tree Topologies Under a Constant Rate of Horizontal Gene Transfer | 2015-08-08 | Paper |
| Learning Poisson binomial distributions | 2015-05-21 | Paper |
| On the Structure, Covering, and Learning of Poisson Multinomial Distributions | 2015-04-30 | Paper |
| Approximate Nash equilibria in anonymous games | 2015-02-13 | Paper |
| On oblivious PTAS's for nash equilibrium | 2015-02-04 | Paper |
| Message passing algorithms and improved LP decoding | 2015-02-04 | Paper |
| Learning $k$-Modal Distributions via Testing | 2015-02-03 | Paper |
| Probabilistic Analysis of Linear Programming Decoding | 2014-12-18 | Paper |
| On the Complexity of Approximating a Nash Equilibrium | 2014-12-05 | Paper |
| The complexity of computing a Nash equilibrium | 2014-11-25 | Paper |
| Optimal phylogenetic reconstruction | 2014-11-25 | Paper |
| Nash equilibria: complexity, symmetries, and approximation | 2014-10-07 | Paper |
| Extreme-Value Theorems for Optimal Multidimensional Pricing | 2014-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417682 | 2014-05-22 | Paper |
| An algorithmic characterization of multi-dimensional mechanisms | 2014-05-13 | Paper |
| Learning Poisson binomial distributions | 2014-05-13 | Paper |
| Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians | 2013-12-04 | Paper |
| Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis | 2013-04-24 | Paper |
| Global alignment of molecular sequences via ancestral state reconstruction | 2012-10-26 | Paper |
| Simple, Optimal and Efficient Auctions | 2011-12-05 | Paper |
| Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep | 2011-10-27 | Paper |
| Sorting and Selection in Posets | 2011-10-18 | Paper |
| Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture | 2011-09-27 | Paper |
| Connectivity and equilibrium in random games | 2011-07-19 | Paper |
| On Learning Algorithms for Nash Equilibria | 2010-10-19 | Paper |
| The Complexity of Computing a Nash Equilibrium | 2010-03-17 | Paper |
| A Note on Strictly Competitive Games | 2009-12-09 | Paper |
| On a Network Generalization of the Minmax Theorem | 2009-07-14 | Paper |
| A note on approximate Nash equilibria | 2009-04-29 | Paper |
| The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games | 2009-03-12 | Paper |
| Probabilistic Analysis of Linear Programming Decoding | 2009-02-24 | Paper |
| An Efficient PTAS for Two-Strategy Anonymous Games | 2009-01-22 | Paper |
| Computing Equilibria in Large Games We Play | 2008-06-19 | Paper |
| First to Market is not Everything: an Analysis of Preferential Attachment with Fitness | 2007-10-25 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
