Contention resolution, matrix scaling and fair allocation
From MaRDI portal
Publication:2085755
DOI10.1007/978-3-030-92702-8_16OpenAlexW4206316631MaRDI QIDQ2085755
Nikhil Bansal, Ilan Reuven Cohen
Publication date: 19 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92702-8_16
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalings of matrices which have prespecified row sums and column sums via optimization
- The Santa Claus problem
- Near-optimal algorithms for unique games
- Rate control for communication networks: shadow prices, proportional fairness and stability
- Discrete Choice Methods with Simulation
- Information Theory and Statistical Mechanics
- Graphical Models, Exponential Families, and Variational Inference
- Online Contention Resolution Schemes
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines
- Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
- Weighted Completion Time Minimization for Unrelated Machines via Iterative Fair Contention Resolution
- Entropy, optimization and counting
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- Applied Choice Analysis
- On the Nucleolus of a Characteristic Function Game
- Games of Strategy
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
This page was built for publication: Contention resolution, matrix scaling and fair allocation