Online max-min fair allocation
From MaRDI portal
Publication:6109544
DOI10.1007/978-3-031-15714-1_30zbMath1520.91208arXiv2111.07235OpenAlexW4226203987MaRDI QIDQ6109544
Publication date: 28 July 2023
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07235
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- On the power of randomization in on-line algorithms
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- The Santa Claus problem
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
- Symmetry exploitation for online machine covering with bounded migration
- Expected Outcomes and Manipulations in Online Fair Division
- Fair Allocation of Indivisible Goods
- On Allocating Goods to Maximize Fairness
- An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
- New Constructive Aspects of the Lovász Local Lemma
- Symmetry Exploitation for Online Machine Covering with Bounded Migration
- Concentration of Measure for the Analysis of Randomized Algorithms
- On-line machine covering
- Online max-min fair allocation
This page was built for publication: Online max-min fair allocation
