Online Fair Division with Additional Information 事件

Online Fair Division with Additional Information arXiv:2505.24503v3 Announce Type: replace-cross Abstract: We study the problem of fairly allocating indivisible goods to agents in an online setting, where goods arrive sequentially and must be allocated irrevocably. Focusing on the popular fairness notions of envy-freeness, proportionality, and maximin share fairness (and their approximate variants), we investigate how access to future information changes what guarantees are achievable. Without