We study online fair division, where indivisible goods arrive one at a time and must be allocated immediately and irrevocably among $n\ge2$ agents. Against an oblivious adversary that fixes the input in advance, we ask what fairness guarantees randomized online algorithms can achieve. We present the Deficit Allocation...
Saar Cohen, Nicholas J. Teh, Michael Wooldridge· 3 citations
Self-play red-teaming improves language-model safety by pitting attacker and defender roles against each other in a zero-sum game. However, real adversaries increasingly use mosaic attacks: multi-turn sequences whose individual fragments are innocuous in isolation yet assemble into a harmful payload. We develop a theor...
Emanuele La Malfa, Saar Cohen, G. La Malfa et al.· 0 citations
This work studies the online allocation of indivisible goods among $n agents, where each good must be allocated immediately and irrevocably upon arrival, and shows that allocating each good to a uniformly random agent among those with positive values achieves an approximation factor arbitrarily close to one for envy-fr...
Saar Cohen, Nicholas J. Teh, Michael Wooldridge· 3 citations
A learning-augmented framework based on predicting joint value-size types, proving consistency under perfect predictions, robustness to prediction error, and showing that separate predictions of value and size marginals are insufficient to recover strong fairness guarantees is developed.
Saar Cohen, Nicholas J. Teh, Paul W. Goldberg et al.· arXiv.org· 4 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.