4.5 Article

Intrinsic Robustness of the Price of Anarchy

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Economics

Decentralized utilitarian mechanisms for scheduling games

Richard Cole et al.

GAMES AND ECONOMIC BEHAVIOR (2015)

Article Economics

Bounding the inefficiency of outcomes in generalized second price auctions

Ioannis Caragiannis et al.

JOURNAL OF ECONOMIC THEORY (2015)

Article Economics

Local smoothness and the price of anarchy in splittable congestion games

Tim Roughgarden et al.

JOURNAL OF ECONOMIC THEORY (2015)

Article Automation & Control Systems

Generalized Efficiency Bounds in Distributed Resource Allocation

Jason R. Marden et al.

IEEE TRANSACTIONS ON AUTOMATIC CONTROL (2014)

Article Mathematics, Applied

BASIC NETWORK CREATION GAMES

Noga Alon et al.

SIAM JOURNAL ON DISCRETE MATHEMATICS (2013)

Article Computer Science, Theory & Methods

Routing (Un-) Splittable Flow in Games with Player-Specific Affine Latency Functions

Martin Gairing et al.

ACM TRANSACTIONS ON ALGORITHMS (2011)

Article Computer Science, Software Engineering

On the Performance of Approximate Equilibria in Congestion Games

George Christodoulou et al.

ALGORITHMICA (2011)

Article Computer Science, Software Engineering

Tight Bounds for Selfish and Greedy Load Balancing

Ioannis Caragiannis et al.

ALGORITHMICA (2011)

Article Computer Science, Theory & Methods

EXACT PRICE OF ANARCHY FOR POLYNOMIAL CONGESTION GAMES

Sebastian Aland et al.

SIAM JOURNAL ON COMPUTING (2011)

Article Computer Science, Theory & Methods

Stackelberg Strategies and Collusion in Network Games with Splittable Flow

Tobias Harks

THEORY OF COMPUTING SYSTEMS (2011)

Article Computer Science, Theory & Methods

Characterizing the Existence of Potential Functions in Weighted Congestion Games

Tobias Harks et al.

THEORY OF COMPUTING SYSTEMS (2011)

Article Economics

Convergence to approximate Nash equilibria in congestion games

Steve Chien et al.

GAMES AND ECONOMIC BEHAVIOR (2011)

Article Operations Research & Management Science

Games and Mechanism Design in Machine Scheduling-An Introduction

Birgit Heydenreich et al.

PRODUCTION AND OPERATIONS MANAGEMENT (2010)

Article Computer Science, Theory & Methods

ON THE COMPLEXITY OF NASH EQUILIBRIA AND OTHER FIXED POINTS

Kousha Etessami et al.

SIAM JOURNAL ON COMPUTING (2010)

Article Computer Science, Theory & Methods

Stackelberg Strategies for Atomic Congestion Games

Dimitris Fotakis

THEORY OF COMPUTING SYSTEMS (2010)

Article Computer Science, Theory & Methods

Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy

Dimitris Fotakis

THEORY OF COMPUTING SYSTEMS (2010)

Article Computer Science, Hardware & Architecture

Settling the Complexity of Computing Two-Player Nash Equilibria

Xi Chen et al.

JOURNAL OF THE ACM (2009)

Article Computer Science, Theory & Methods

THE COMPLEXITY OF COMPUTING A NASH EQUILIBRIUM

Constantinos Daskalakis et al.

SIAM JOURNAL ON COMPUTING (2009)

Article Computer Science, Theory & Methods

Coordination mechanisms

George Christodoulou et al.

THEORETICAL COMPUTER SCIENCE (2009)

Article Economics

Congestion games with malicious players

Moshe Babaioff et al.

GAMES AND ECONOMIC BEHAVIOR (2009)

Article Economics

Strong equilibrium in cost sharing connection games

Amir Epstein et al.

GAMES AND ECONOMIC BEHAVIOR (2009)

Article Computer Science, Interdisciplinary Applications

SELFISH ROUTING IN THE PRESENCE OF NETWORK UNCERTAINTY

Chryssis Georgiou et al.

PARALLEL PROCESSING LETTERS (2009)

Article Economics

Strong price of anarchy

Nir Andelman et al.

GAMES AND ECONOMIC BEHAVIOR (2009)

Article Computer Science, Hardware & Architecture

On the Impact of Combinatorial Structure on Congestion Games

Heiner Ackermann et al.

JOURNAL OF THE ACM (2008)

Article Computer Science, Theory & Methods

THE PRICE OF STABILITY FOR NETWORK DESIGN WITH FAIR COST ALLOCATION

Elliot Anshelevich et al.

SIAM JOURNAL ON COMPUTING (2008)

Article Computer Science, Theory & Methods

A new model for selfish routing

Thomas Luecking et al.

THEORETICAL COMPUTER SCIENCE (2008)

Article Economics

A geometric approach to the price of anarchy in nonatomic congestion games

Jose R. Correa et al.

GAMES AND ECONOMIC BEHAVIOR (2008)

Article Computer Science, Theory & Methods

Selfish routing with incomplete information

Martin Gairing et al.

THEORY OF COMPUTING SYSTEMS (2008)

Article Computer Science, Software Engineering

Equilibria for networks with malicious users

George Karakostas et al.

MATHEMATICAL PROGRAMMING (2007)

Article Operations Research & Management Science

The Price of anarchy under Nonlinear and asymmetric costs

Georgia Perakis

MATHEMATICS OF OPERATIONS RESEARCH (2007)

Article Computer Science, Software Engineering

Selfish load balancing and atomic congestion games

Subhash Suri et al.

ALGORITHMICA (2007)

Article Engineering, Electrical & Electronic

Market sharing games applied to content distribution in ad hoc networks

MX Goemans et al.

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2006)

Article Operations Research & Management Science

Selfish routing in capacitated networks

JR Correa et al.

MATHEMATICS OF OPERATIONS RESEARCH (2004)

Article Economics

Bounding the inefficiency of equilibria in nonatomic congestion games

T Roughgarden et al.

GAMES AND ECONOMIC BEHAVIOR (2004)

Article Computer Science, Hardware & Architecture

The price of anarchy is independent of the network topology

T Roughgarden

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2003)

Article Computer Science, Theory & Methods

Approximate equilibria and ball fusion

E Koutsoupias et al.

THEORY OF COMPUTING SYSTEMS (2003)