Algorithms – ESA 2005
From MaRDI portal
Publication:5475819
DOI10.1007/11561071zbMath1162.91305OpenAlexW2501059503MaRDI QIDQ5475819
Elias Koutsoupias, George Christodoulou
Publication date: 27 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11561071
Related Items (40)
Improved Lower Bounds on the Price of Stability of Undirected Network Design Games ⋮ Coordination mechanisms ⋮ Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games ⋮ The Price of Matching with Metric Preferences ⋮ On Nash Equilibrium in Repeated Hierarchical Games ⋮ Improved lower bounds on the price of stability of undirected network design games ⋮ The price of anarchy for polynomial social cost ⋮ Social context congestion games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the performance of approximate equilibria in congestion games ⋮ Graphical congestion games ⋮ The price of stability for undirected broadcast network design with fair cost allocation is constant ⋮ Convergence and approximation in potential games ⋮ Tight bounds for selfish and greedy load balancing ⋮ Performance of one-round walks in linear congestion games ⋮ Price of stability in survivable network design ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Approximate Strong Equilibrium in Job Scheduling Games ⋮ The impact of social ignorance on weighted congestion games ⋮ Non-cooperative facility location and covering games ⋮ Congestion games with priority-based scheduling ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Exact and approximate equilibria for optimal group network formation ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Equilibrium strategies for multiple interdictors on a common network ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Network design with weighted players ⋮ Price of anarchy and price of stability in multi-agent project scheduling ⋮ Unnamed Item ⋮ Strong price of anarchy ⋮ Price of anarchy for Mean Field Games ⋮ Exact enforcement value of soft correlated equilibrium for generalized chicken and prisoner's dilemma games ⋮ On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games ⋮ On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ Timed network games ⋮ On the sequential price of anarchy of isolation games
This page was built for publication: Algorithms – ESA 2005
