Publication:3002793
From MaRDI portal
DOI10.4086/toc.2008.v004a004zbMath1213.68698OpenAlexW2216069677MaRDI QIDQ3002793
Éva Tardos, Anirban Dasgupta, Tom Wexler, Elliot Anshelevich
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2008.v004a004
Analysis of algorithms (68W40) Communication networks in operations research (90B18) Games involving graphs (91A43) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items
Non-cooperative capacitated facility location games, Nash equilibria with minimum potential in undirected broadcast games, \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games, Logit dynamics with concurrent updates for local interaction potential games, Social distancing network creation, Selfish bin coloring, Strategic cooperation in cost sharing games, Geometric Network Creation Games, Unnamed Item, Strategic multiway cut and multicut games, Graphical congestion games, Resource buying games, Minimizing Rosenthal potential in multicast games, LP-based covering games with low price of anarchy, Non-cooperative facility location and covering games, Competitive cost sharing with economies of scale, Pricing traffic in a spanning network, Exact and approximate equilibria for optimal group network formation, Strategic network formation through peering and service agreements, Designing Networks with Good Equilibria under Uncertainty, A Characterization of Undirected Graphs Admitting Optimal Cost Shares, Efficient Black-Box Reductions for Separable Cost Sharing, The price of anarchy for network formation in an adversary model, Enforcing efficient equilibria in network design games via subsidies, Bottleneck links, variable demand, and the tragedy of the commons
