Multilevel Fair Allocation under Additive Preferences

arXiv:2608.24400 · cs.GT, cs.AI, cs.MA · Submitted 2026-08-25 · Read on arXiv

cs.GT, cs.AI, cs.MA

Submitted: 2026-08-25

Updated: 2026-08-25

Comments: Accepted at the 9th International conference on Algorithmic Decision Theory

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Adaptation — 13× in this paper · explained in 1 episode
• Weighted Round Robin — 6× in this paper
• Multilevel Weighted Round Robin — 3× in this paper
• Aggregation — 1× in this paper · explained in 1 episode
• Allocator — 1× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• Trace — 1× in this paper · explained in 2 episodes

Sources

• Mechanism Design with Delegated Bidding
• Multilevel Fair Allocation with Matroid-Rank Preferences

Related papers

• Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
• Optimizing Social Utility in Sequential Experiments
• In-Context Credit Assignment via the Core
• Temporal Liquidity Crossing for Blockchains: An EIP-1559 Extension for Admission Below the Base Fee
• Optimal Regret for Online Market Making with Limit Order Book
• Breaking 1/epsilon Barrier in Quantum Zero-Sum Games: Generalizing Metric Subregularity for Spectraplexes