Market design to accelerate COVID-19 vaccine supply

JC Castillo, A Ahuja, S Athey, A Baker, E Budish… - Science, 2021 - science.org
Each month, COVID-19 kills hundreds of thousands of people, reduces global gross
domestic product (GDP) by hundreds of billions of dollars, and generates large …

Fair algorithms for selecting citizens' assemblies

B Flanigan, P Gölz, A Gupta, B Hennig, AD Procaccia - Nature, 2021 - nature.com
Globally, there has been a recent surge in 'citizens' assemblies', which are a form of civic
participation in which a panel of randomly selected constituents contributes to questions of …

Almost envy-freeness with general valuations

B Plaut, T Roughgarden - SIAM Journal on Discrete Mathematics, 2020 - SIAM
The goal of fair division is to distribute resources among competing players in a “fair" way.
Envy-freeness is the most extensively studied fairness notion in fair division. Envy-free …

Finding fair and efficient allocations

S Barman, SK Krishnamurthy, R Vaish - … of the 2018 ACM Conference on …, 2018 - dl.acm.org
We study the problem of allocating a set of indivisible goods among a set of agents in a fair
and efficient manner. An allocation is said to be fair if it is envy-free up to one good (EF1) …

Marketplaces, markets, and market design

AE Roth - American Economic Review, 2018 - aeaweb.org
Marketplaces are often small parts of large markets, and both markets and marketplaces
come in many varieties. Market design seeks to understand what marketplaces must …

EFX exists for three agents

BR Chaudhury, J Garg, K Mehlhorn - Journal of the ACM, 2024 - dl.acm.org
We study the problem of distributing a set of indivisible goods among agents with additive
valuations in a fair manner. The fairness notion under consideration is envy-freeness up to …

Approximation algorithms for maximin fair division

S Barman, SK Krishnamurthy - ACM Transactions on Economics and …, 2020 - dl.acm.org
We consider the problem of allocating indivisible goods fairly among n agents who have
additive and submodular valuations for the goods. Our fairness guarantees are in terms of …

Applications of matching models under preferences

P Biró - 2017 - books.google.com
Matching problems under preferences have been studied widely in mathematics, computer
science and economics, starting with the seminal paper by Gale and Shapley (1962). A …

Strategy-proofness in the large

EM Azevedo, E Budish - The Review of Economic Studies, 2019 - academic.oup.com
We propose a criterion of approximate incentive compatibility, strategy-proofness in the
large (SP-L), and argue that it is a useful second-best to exact strategy-proofness (SP) for …

Welfare maximization in competitive equilibrium: Reinforcement learning for markov exchange economy

Z Liu, M Lu, Z Wang, M Jordan… - … Conference on Machine …, 2022 - proceedings.mlr.press
We study a bilevel economic system, which we refer to as a Markov exchange economy
(MEE), from the point of view of multi-agent reinforcement learning (MARL). An MEE …