Multistage online maxmin allocation of indivisible entities

DOI10.1016/j.tcs.2022.08.027OpenAlexW3216026871MaRDI QIDQ2676469

Siu-Wing Cheng

Publication date: 27 September 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.00320

zbMATH Keywords

online algorithmmaxmin allocationstability reward

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• The Santa Claus problem
• Priority Search Trees
• A new approximation technique for resource‐allocation problems
• On the Tradeoff between Stability and Fit
• Combinatorial Algorithm for Restricted Max-Min Fair Allocation
• Restricted Max-Min Fair Allocation
• A Tale of Santa Claus, Hypergraphs and Matroids
• Changing Bases: Multistage Optimization for Matroids and Matchings
• On Allocating Goods to Maximize Fairness
• Competitive Analysis via Regularization
• An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
• New Constructive Aspects of the Lovász Local Lemma

This page was built for publication: Multistage online maxmin allocation of indivisible entities