Publication:3002793
From MaRDI portal
DOI10.4086/toc.2008.v004a004zbMath1213.68698MaRDI 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
68W40: Analysis of algorithms
90B18: Communication networks in operations research
91A43: Games involving graphs
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Unnamed Item, Efficient Black-Box Reductions for Separable Cost Sharing, Designing Networks with Good Equilibria under Uncertainty, A Characterization of Undirected Graphs Admitting Optimal Cost Shares, Bottleneck links, variable demand, and the tragedy of the commons, Social distancing network creation, 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, Selfish bin coloring, Resource buying games, Minimizing Rosenthal potential in multicast games, LP-based covering games with low price of anarchy, Competitive cost sharing with economies of scale, Graphical congestion games, Exact and approximate equilibria for optimal group network formation, Strategic network formation through peering and service agreements, Logit dynamics with concurrent updates for local interaction potential games, Non-cooperative facility location and covering games, Strategic cooperation in cost sharing games, Strategic multiway cut and multicut games, Pricing traffic in a spanning network, The price of anarchy for network formation in an adversary model, Enforcing efficient equilibria in network design games via subsidies
