On equilibria for ADM minimization games

DOI10.1007/S00453-011-9530-5zbMATH Open1237.91056OpenAlexW2063300435MaRDI 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 analysisADM minimizationlocal search heuristics

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Cooperative games (91A12) Games involving graphs (91A43) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

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

This page was built for publication: On equilibria for ADM minimization games