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
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
The proposed Multi-Agent Fundamental Analysis with Symbolic Adaptive learning (MUFASA), a hierarchical multi-agent framework for symbolic discovery in finance, achieves state-of-the-art performance on the valuation task compared to classical finance methods, financial large language models, and SR approaches.
Kelvin J. L. Koa, Filip Orestav, Sheng-Qiong Wu et al.· 0 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.