On equilibria for ADM minimization games

DOI10.1007/s00453-011-9530-5zbMath1237.91056MaRDI QIDQ2429352

Asaf Levin, Leah Epstein

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9530-5

zbMATH Keywords

worst case analysis; ADM minimization; local search heuristics

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

91A10: Noncooperative games

91A12: Cooperative games

91A43: Games involving graphs

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The chord version for SONET ADMs minimization
• On minimizing the number of ADMs--tight bounds for an algorithm without preprocessing
• Selfishness, collusion and power of local search for the ADMs minimization problem
• The price of selfish routing
• Better bounds for minimizing SONET ADMs
• Strong price of anarchy
• Traffic partition in WDM/SONET rings to minimize SONET ADMs
• Minimization of SONET ADMs in ring networks revisited
• A class of games possessing pure-strategy Nash equilibria
• Non-cooperative games
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Combinatorial Optimization with Rational Objective Functions
• Algorithms, games, and the internet