Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313021
DOI10.1007/b99805zbMath1105.91300OpenAlexW4301133941MaRDI QIDQ5313021
Adrian Vetta, Vahab S. Mirrokni
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
Related Items (22)
Efficient coordination mechanisms for unrelated machine scheduling ⋮ On spectrum sharing games ⋮ On the convergence of multicast games in directed networks ⋮ The Price of Anarchy of generic valid utility systems ⋮ Convergence of incentive-driven dynamics in Fisher markets ⋮ On the performance of mildly greedy players in cut games ⋮ Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks ⋮ Convergence to approximate Nash equilibria in congestion games ⋮ Convergence and approximation in potential games ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Performance of one-round walks in linear congestion games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Non-atomic one-round walks in congestion games ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Profit sharing with thresholds and non-monotone player utilities ⋮ Computer science and decision theory ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ Dynamics of Profit-Sharing Games ⋮ Convergence method, properties and computational complexity for Lyapunov games ⋮ Some anomalies of farsighted strategic behavior
This page was built for publication: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
