| Publication | Date of Publication | Type |
|---|
| School redistricting: wiping unfairness off the map | 2024-11-28 | Paper |
| Fair and efficient online allocations | 2024-09-05 | Paper |
| Dynamic placement in refugee resettlement | 2024-07-29 | Paper |
| Compact redistricting plans have many spanning trees | 2024-07-19 | Paper |
| Fair division with binary valuations: one rule to rule them all | 2023-03-21 | Paper |
| Computation-Aware Data Aggregation. | 2023-02-03 | Paper |
| Compact Redistricting Plans Have Many Spanning Trees | 2021-09-27 | Paper |
| Loss Functions, Axioms, and Peer Review | 2021-05-25 | Paper |
| Fairly Allocating Many Goods with Few Queries | 2021-04-28 | Paper |
| Liquid Democracy: An Algorithmic Perspective | 2021-03-26 | Paper |
| Introduction to Computational Social Choice | 2020-11-12 | Paper |
| Cake Cutting Algorithms | 2020-11-12 | Paper |
| Ignorance Is Almost Bliss: Near-Optimal Stochastic Matching with Few Queries | 2020-11-04 | Paper |
| The fluid mechanics of liquid democracy | 2020-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633920 | 2019-05-06 | Paper |
| Fair Enough | 2018-12-06 | Paper |
| Opting Into Optimal Matchings | 2018-07-16 | Paper |
| Which Is the Fairest (Rent Division) of Them All? | 2018-05-17 | Paper |
| A partisan districting protocol with provably nonpartisan outcomes | 2017-10-24 | Paper |
| Verifiably Truthful Mechanisms | 2017-05-19 | Paper |
| Subset Selection Via Implicit Utilitarian Voting | 2017-01-18 | Paper |
| Voting rules as error-correcting codes | 2015-12-28 | Paper |
| Optimal social choice functions: a utilitarian view | 2015-12-21 | Paper |
| Socially desirable approximations for dodgson’s voting rule | 2015-08-14 | Paper |
| Mix and match: a strategyproof mechanism for multi-hospital kidney exchange | 2015-06-08 | Paper |
| An improved 2-agent kidney exchange mechanism | 2015-06-01 | Paper |
| No Agent Left Behind: Dynamic Fair Division of Multiple Resources | 2015-01-14 | Paper |
| A Smooth Transition from Powerlessness to Absolute Power | 2014-01-08 | Paper |
| Truth, justice, and cake cutting | 2013-11-14 | Paper |
| Algorithms for strategyproof classification | 2012-11-15 | Paper |
| On the approximability of Dodgson and Young elections | 2012-11-15 | Paper |
| Voting almost maximizes social welfare despite limited communication | 2011-11-17 | Paper |
| A new perspective on implementation by voting trees | 2011-08-09 | Paper |
| Implementation by mediated equilibrium | 2011-05-05 | Paper |
| Strategyproof Approximation of the Minimax on Networks | 2011-04-27 | Paper |
| Walking in circles | 2010-10-28 | Paper |
| Incentive compatible regression learning | 2010-10-07 | Paper |
| A note on competitive diffusion through social networks | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579413 | 2010-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579475 | 2010-08-06 | Paper |
| A note on the query complexity of the Condorcet winner problem | 2010-06-09 | Paper |
| The learnability of voting rules | 2009-09-14 | Paper |
| Algorithms for the coalitional manipulation problem | 2009-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624050 | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3624161 | 2009-04-28 | Paper |
| On the complexity of achieving proportional representation | 2008-05-14 | Paper |
