7 citations · 17 across the 12 of their papers we have counts for
3 papers · 1 filter
Online Combinatorial Allocation with Interdependent Values
Michal Feldman, Simon Mauras, Divyarthi Mohan +1
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each a…
Two-Sided Matching with Resource-Regional Caps
Felipe Garrido-Lucero, Denis Sokolov, Patrick Loiseau +1
We study two-sided many-to-one matching problems under a novel type of distributional constraints, resource-regional caps. In the context of college admissions, under resource-regi…
Stable Marriage: Loyalty vs. Competition
Amit Ronen, Jonah Evan Hess, Yael Belfer +2
We consider the stable matching problem (e.g. between doctors and hospitals) in a one-to-one matching setting, where preferences are drawn uniformly at random. It is known that whe…