Atomic resource sharing in noncooperative networks

From MaRDI portal
Publication:5944340

DOI10.1023/A:1016770831869zbMath0971.68664MaRDI QIDQ5944340

Lavy Libman, Ariel Orda

Publication date: 6 November 2001

Published in: Telecommunication Systems (Search for Journal in Brave)




Related Items

Bottleneck Congestion Games with Logarithmic Price of Anarchy, Network QoS games: stability vs optimality tradeoff, Atomic routing games on maximum congestion, Computation of equilibria and the price of anarchy in bottleneck congestion games, Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses, Nonpreemptive coordination mechanisms for identical machines, Cost sharing and strategyproof mechanisms for set cover games, Sharing Non-anonymous Costs of Multiple Resources Optimally, Equilibria in a class of aggregative location games, Performance of one-round walks in linear congestion games, Characterizing the existence of potential functions in weighted congestion games, On approximate pure Nash equilibria in weighted congestion games with polynomial latencies, Distributed Learning of Wardrop Equilibria, The complexity of pure equilibria in mix-weighted congestion games on parallel links, Network topology and equilibrium existence in weighted network congestion games, Malicious Bayesian Congestion Games, The price of anarchy is independent of the network topology, Congestion Games with Variable Demands, On the Existence of Pure Nash Equilibria in Weighted Congestion Games, Atomic Congestion Games: Fast, Myopic and Concurrent, Congestion Games with Multi-Dimensional Demands, Project games, Weighted congestion games with separable preferences, The Price of Stability of Weighted Congestion Games, The Price of Stability of Weighted Congestion Games, Selfish unsplittable flows, A unifying approximate potential for weighted congestion games, Equilibria in Multiclass and Multidimensional Atomic Congestion Games, Pure Nash Equilibria in Resource Graph Games