On Approximate Nash Equilibria in Network Design

DOI10.1080/15427951.2012.754800zbMath1341.91022OpenAlexW1974040162MaRDI QIDQ2808835

Pascal Lenzner, Susanne Albers

Publication date: 25 May 2016

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15427951.2012.754800

Mathematics Subject Classification ID

Noncooperative games (91A10) Cooperative games (91A12) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (2)

Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions ⋮ Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions

This page was built for publication: On Approximate Nash Equilibria in Network Design