A lone divider allocation algorithm with subjective divisibility
Uriel Feige
Abstract
In the subjective divisibility allocation model, all goods are divisible, every agent i has a non-negative additive valuation function vi, where for some goods vi is additive over fractions of the good, and for some goods, any fraction smaller than~1 has value~0. Previous work established the existence of 59-MMS allocations in this setting. We show that 35-MMS allocations exist. Our proof is based on an adaptation of the lone divider framework.
Create a lesson
Related papers
Algorithms for Robbins' Problem using Markov Decision Processes
Léonard Brice, F. Thomas Bruss, Anirban Majumdar et al.
Token-Level Advertising
Hanbing Liu, Bowei Zhang, Changyuan Yu et al.
Blindfolded pursuit with delays of your choice
Torben Schürenberg, Maximilian J. Stahlberg
Robust Lottery Compression for Metric Voting: A Transfer Principle for Bounded Randomness
Jianhao Jia, Bo Peng
Trusting AI in Competitive Markets
Jussi Keppo, Yuze Li, Gerry Tsoukalas et al.
Simultaneous Envy and Equitability Guarantees
Hadi Hosseini, Shraddha Pathak, Lirong Xia et al.