Showing cs.GTShow all
3 papers · 1 filter
cs.GT2026
Online Fair Division under an Oblivious Adversary
Saar Cohen, Nicholas Teh, Michael Wooldridge
We study online fair division, where indivisible goods arrive one at a time and must be allocated immediately and irrevocably among agents. Against an oblivious adversary t…
cs.GT2026
Online House Allocation with Subsidy
Nicholas Teh, Saar Cohen, Karen Frilya Celine +2
House allocation is a fundamental problem in which each agent is assigned exactly one house. While the classical model assumes that all houses are available before the allocation i…
cs.GT2026
Online Fair Division with Budget Constraints
Saar Cohen, Nicholas Teh, Paul W. Goldberg +1
We study an online variant of discrete fair division under generalized assignment budget constraints. Goods arrive one at a time and must be assigned irrevocably to a feasible agen…