No justified complaints

DOI10.1145/2090236.2090243zbMath1348.91197MaRDI QIDQ2826045

Danny Dolev, Nathan Linial, Joseph Y. Halpern, Raz Kupferman, Dror G. Feitelson

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090243

zbMATH Keywords

resource allocation; bottleneck; fair share

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

A Further Analysis of the Dynamic Dominant Resource Fairness Mechanism, Nash Social Welfare Approximation for Strategic Agents, EFX under budget constraint, Exact and approximation algorithms for PMMS under identical constraints, Fair and efficient multi-resource allocation for cloud computing, The existence and efficiency of PMMS allocations, Swarm optimization algorithms applied to multi-resource fair allocation in heterogeneous cloud computing systems, Egalitarian division under Leontief preferences, Polyhedral Clinching Auctions and the AdWords Polytope

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES