scientific article; zbMATH DE number 6783393

zbMath1377.91018MaRDI QIDQ5365041

Florian Schoppmann, Tim Roughgarden

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133058

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10)

Related Items (10)

Strategic decentralization in binary choice composite congestion games ⋮ Collusion in atomic splittable routing games ⋮ Incentives and Efficiency in Uncertain Collaborative Environments ⋮ Inefficiency of games with social context ⋮ Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games ⋮ LP-based covering games with low price of anarchy ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Collusion in Atomic Splittable Routing Games ⋮ Bounding the inefficiency of outcomes in generalized second price auctions ⋮ Achieving target equilibria in network routing games without knowing the latency functions

This page was built for publication: