| Publication | Date of Publication | Type |
|---|
| Combinatorial contracts beyond Gross substitutes | 2024-11-28 | Paper |
| Truthful matching with online items and Offline agents | 2024-11-14 | Paper |
| Combinatorial auctions with interdependent valuations: SOS to the rescue | 2024-06-27 | Paper |
| Interdependent public projects | 2024-05-14 | Paper |
| ``Who is next in line? On the significance of knowing the arrival order in Bayesian online settings | 2024-05-14 | Paper |
| An economics-based analysis of RANKING for online bipartite matching | 2024-05-14 | Paper |
| Multi-agent contracts | 2024-05-08 | Paper |
| Truthful Matching with Online Items and Offline Agents | 2024-04-24 | Paper |
| On Fair Division under Heterogeneous Matroid Constraints | 2023-08-28 | Paper |
| Lookahead auctions with pooling | 2023-07-28 | Paper |
| Simultaneous 2nd price item auctions with no-underbidding | 2023-06-23 | Paper |
| On the power and limits of dynamic pricing in combinatorial markets | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875458 | 2023-02-03 | Paper |
| Auction Design under Interdependent Values (Invited Talk) | 2022-07-21 | Paper |
| Prophet Matching with General Arrivals | 2022-06-27 | Paper |
| Prophet inequality with competing agents | 2022-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077148 | 2022-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009585 | 2021-08-04 | Paper |
| A Simple and Approximately Optimal Mechanism for a Buyer with Complements | 2021-06-17 | Paper |
| Simultaneous auctions without complements are (almost) efficient | 2020-10-26 | Paper |
| Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs | 2020-08-03 | Paper |
| Pricing multi-unit markets | 2020-06-18 | Paper |
| Pricing Social Goods | 2020-05-27 | Paper |
| Approximate Modularity Revisited | 2020-01-28 | Paper |
| Online random sampling for budgeted settings | 2019-09-05 | Paper |
| Stable secretaries | 2019-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633920 | 2019-05-06 | Paper |
| Oblivious Rounding and the Integrality Gap | 2018-04-19 | Paper |
| The efficiency of best-response dynamics | 2018-02-13 | Paper |
| Liquid price of anarchy | 2018-02-13 | Paper |
| Online random sampling for budgeted settings | 2018-02-13 | Paper |
| Combinatorial Auctions via Posted Prices | 2017-10-05 | Paper |
| The price of anarchy in large games | 2017-09-29 | Paper |
| Approximate modularity revisited | 2017-08-17 | Paper |
| Sequential decision making with vector outcomes | 2017-05-19 | Paper |
| Reaching Consensus via non-Bayesian Asynchronous Learning in Social Networks | 2017-03-22 | Paper |
| Correlated and Coarse Equilibria of Single-Item Auctions | 2017-02-10 | Paper |
| Capacitated network design games | 2016-01-13 | Paper |
| Welfare and Revenue Guarantees for Competitive Bundling Equilibrium | 2016-01-08 | Paper |
| Combinatorial Walrasian Equilibrium | 2016-01-07 | Paper |
| A Unified Framework for Strong Price of Anarchy in Clustering Games | 2015-11-04 | Paper |
| Economical Graph Discovery | 2015-08-28 | Paper |
| Bayesian ignorance | 2015-03-02 | Paper |
| Clearing Markets via Bundles | 2015-01-14 | Paper |
| Limits of Efficiency in Sequential Auctions | 2015-01-12 | Paper |
| The Asymmetric Matrix Partition Problem | 2015-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934597 | 2014-12-18 | Paper |
| Convergence of best-response dynamics in games with conflicting congestion effects | 2014-12-09 | Paper |
| Simultaneous auctions are (almost) efficient | 2014-08-07 | Paper |
| Combinatorial walrasian equilibrium | 2014-08-07 | Paper |
| Approximate strong equilibria in job scheduling games with two uniformly related machines | 2014-04-22 | Paper |
| Mechanism design with a restricted action space | 2014-03-13 | Paper |
| Adversarial Leakage in Games | 2013-06-27 | Paper |
| Capacitated Network Design Games | 2013-03-13 | Paper |
| On the approximability of Dodgson and Young elections | 2012-11-15 | Paper |
| Conflicting Congestion Effects in Resource Allocation Games | 2012-11-08 | Paper |
| Computing optimal contracts in combinatorial agencies | 2012-10-11 | Paper |
| Bayesian ignorance | 2012-10-11 | Paper |
| Envy-free makespan approximation | 2012-05-30 | Paper |
| Combinatorial agency | 2012-05-14 | Paper |
| Dynamic Inefficiency: Anarchy without Stability | 2011-10-28 | Paper |
| Strategyproof Approximation of the Minimax on Networks | 2011-04-27 | Paper |
| Walking in circles | 2010-10-28 | Paper |
| A note on competitive diffusion through social networks | 2010-09-07 | Paper |
| Mixed Strategies in Combinatorial Agency | 2010-08-06 | Paper |
| Approximate Strong Equilibrium in Job Scheduling Games | 2009-12-10 | Paper |
| Partition Equilibrium | 2009-12-01 | Paper |
| Free-Riding and Free-Labor in Combinatorial Agency | 2009-12-01 | Paper |
| Strong equilibrium in cost sharing connection games | 2009-08-27 | Paper |
| Efficient graph topologies in network routing games | 2009-06-08 | Paper |
| Strong price of anarchy | 2009-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3524732 | 2008-09-12 | Paper |
| Approximate Strong Equilibrium in Job Scheduling Games | 2008-05-02 | Paper |
