Worst-case equilibria

Authors:
Elias Koutsoupias;Christos Papadimitriou
Affiliations:
Univ of California, Los Angeles;Univ of California, Berkeley
Venue:
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Year:
1999

Citing 3
Cited 479

On complexity as bounded rationality (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the existence of equilibria in noncooperative optimal flow control

Journal of the ACM (JACM)
Making greed work in networks: a game-theoretic analysis of switch service disciplines

IEEE/ACM Transactions on Networking (TON)

Stackelberg scheduling strategies

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The price of selfish routing

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Selfish traffic allocation for server farms

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The price of anarchy is independent of the network topology

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers

Journal of the ACM (JACM)
Load Balancing in Distributed Systems: An Approach Using Cooperative Games

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Algorithms, Games, and the Internet

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Improved Results for Stackelberg Scheduling Strategies

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Algorithms for Rational Agents

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Competitive safety analysis

Eighteenth national conference on Artificial intelligence
On the computational complexity of bisimulation, redux

PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
k-Implementation

Proceedings of the 4th ACM conference on Electronic commerce
Playing large games using simple strategies

Proceedings of the 4th ACM conference on Electronic commerce
Near-optimal network design with selfish agents

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Pure Nash equilibria: hard and easy games

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Distributed algorithm engineering

Experimental algorithmics
On selfish routing in internet-like environments

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On a network creation game

Proceedings of the twenty-second annual symposium on Principles of distributed computing
SIGACT news online algorithms column 1

ACM SIGACT News
The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002
Network games

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
How to route and tax selfish unsplittable traffic

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
On spectrum sharing games

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Optimizing cost and performance for multihoming

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Multi-Agent Service Description/Discovery Games

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Network QoS games: stability vs optimality tradeoff

Journal of Computer and System Sciences
Coordination mechanisms for congestion games

ACM SIGACT News
Energy efficient communication in ad hoc networks from user's and designer's perspective

ACM SIGMOBILE Mobile Computing and Communications Review
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Inefficiency in provisioning interconnected communication networks

Proceedings of the 6th ACM conference on Electronic commerce
Congestion games with failures

Proceedings of the 6th ACM conference on Electronic commerce
Inoculation strategies for victims of viruses and the sum-of-squares partition problem

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast convergence of selfish rerouting

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The price of selfish behavior in bilateral network formation

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A network pricing game for selfish traffic

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Selfish routing with incomplete information

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Fair Bandwidth Sharing in Distributed Systems: A Game-Theoretic Approach

IEEE Transactions on Computers
Sink Equilibria and Convergence

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On nash equilibria for a network creation game

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Distributed selfish load balancing

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Bottleneck links, variable demand, and the tragedy of the commons

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A survey on networking games in telecommunications

Computers and Operations Research
2005: an offline persepctive

ACM SIGACT News
The effect of collusion in congestion games

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Linear tolls suffice: new bounds and algorithms for tolls in single source networks

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Selfish unsplittable flows

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Welfare maximization in congestion games

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Non-cooperative multicast and facility location games

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Incentive-compatible interdomain routing

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Structure and complexity of extreme Nash equilibria

Theoretical Computer Science - Game theory meets theoretical computer science
How much can taxes help selfish routing?

Journal of Computer and System Sciences - Special issue on network algorithms 2005
When selfish meets evil: byzantine players in a virus inoculation game

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Network design with weighted players

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On the severity of Braess's paradox: designing networks for selfish users is hard

Journal of Computer and System Sciences - Special issue on FOCS 2001
Resource selection games with unknown number of players

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Tradeoffs in worst-case equilibria

Theoretical Computer Science - Approximation and online algorithms
Inoculation strategies for victims of viruses and the sum-of-squares partition problem

Journal of Computer and System Sciences
Tight bounds for worst-case equilibria

ACM Transactions on Algorithms (TALG)
Noncooperative load balancing in distributed systems

Journal of Parallel and Distributed Computing
On selfish routing in internet-like environments

IEEE/ACM Transactions on Networking (TON)
Utilitarian resource assignment

Journal of Discrete Algorithms
Competition and Efficiency in Congested Markets

Mathematics of Operations Research
The price of anarchy for polynomial social cost

Theoretical Computer Science
On the structure and complexity of worst-case equilibria

Theoretical Computer Science
On the convergence of multicast games in directed networks

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Eisenberg-Gale markets: algorithms and structural properties

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Strong equilibrium in cost sharing connection games

Proceedings of the 8th ACM conference on Electronic commerce
Stackelberg thresholds in network routing games or the value of altruism

Proceedings of the 8th ACM conference on Electronic commerce
Congestion games with load-dependent failures: identical resources

Proceedings of the 8th ACM conference on Electronic commerce
Convergence time to Nash equilibrium in load balancing

ACM Transactions on Algorithms (TALG)
Taxes for linear atomic congestion games

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Greedy distributed optimization of multi-commodity flows

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
The price of anarchy in network creation games

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Game authority for robust andscalable distributed selfish-computer systems

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Efficient contention resolution protocols for selfish agents

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Cheap labor can be expensive

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Buying cheap is expensive: hardness of non-parametric multi-product pricing

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The effectiveness of Stackelberg strategies and tolls for network congestion games

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum-lifetime routing: system optimization & game-theoretic perspectives

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Routing selfish unsplittable traffic

ACM Transactions on Algorithms (TALG)
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks

IEEE Transactions on Parallel and Distributed Systems
Routing games with an unknown set of active players

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
How to measure efficiency?

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
On the value of coordination in network design

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
(Almost) optimal coordination mechanisms for unrelated machine scheduling

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Mixed Nash equilibria in selfish routing problems with dynamic constraints

Theoretical Computer Science
A joint selfish routing and channel assignment game in wireless mesh networks

Computer Communications
On Nash equilibria for multicast transmissions in ad-hoc wireless networks

Wireless Networks
Impact of Asynchrony on the Behavior of Rational Selfish Agents

Fundamenta Informaticae
Regret minimization and the price of total anarchy

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Online multicast with egalitarian cost sharing

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Atomic congestion games among coalitions

ACM Transactions on Algorithms (TALG)
Altruism, selfishness, and spite in traffic routing

Proceedings of the 9th ACM conference on Electronic commerce
Adaptive navigation of vehicles in congested road networks

Proceedings of the 5th international conference on Pervasive services
Scheduling to maximize participation

Theoretical Computer Science
Bounded budget connection (BBC) games or how to make friends and influence people, on a budget

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A few good agents: multi-agent social learning

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
Efficiency of selfish investments in network security

Proceedings of the 3rd international workshop on Economics of networked systems
The impact of local policies on the quality of packet routing in paths, trees, and rings

Journal of Scheduling
A new model for selfish routing

Theoretical Computer Science
On Satisfiability Games and the Power of Congestion Games

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Distributed Learning of Wardrop Equilibria

UC '08 Proceedings of the 7th international conference on Unconventional Computing
The effect of local scheduling in load balancing designs

ACM SIGMETRICS Performance Evaluation Review
Understanding the power of distributed coordination for dynamic spectrum management

Mobile Networks and Applications
On domination game analysis for microeconomic data mining

ACM Transactions on Knowledge Discovery from Data (TKDD)
A graph-theoretic network security game

International Journal of Autonomous and Adaptive Communications Systems
Ranking games

Artificial Intelligence
The Influence of Link Restrictions on (Random) Selfish Routing

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Anarchy on Uniformly Related Machines Revisited

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Approximate Strong Equilibrium in Job Scheduling Games

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Facets of the Fully Mixed Nash Equilibrium Conjecture

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Sensitivity of Wardrop Equilibria

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Anarchy of a Network Creation Game with Exponential Payoff

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Local and Global Price of Anarchy of Graphical Games

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
The Price of Stochastic Anarchy

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Avoidance of Traffic Delay for Panicking Crowds Subject to Information Propagation

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
Improved equilibria via public service advertising

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The power of verification for one-parameter agents

Journal of Computer and System Sciences
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions

Theoretical Computer Science
How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Road to $\mathcal{PLS}$-Completeness: 8 Agents in a Singleton Congestion Game

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Conflicting Congestion Effects in Resource Allocation Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
The Price of Malice in Linear Congestion Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Worst-Case Nash Equilibria in Restricted Routing

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Stackelberg Routing in Arbitrary Networks

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Taxing Subnetworks

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improving the Efficiency of Load Balancing Games through Taxes

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Network Formation and Routing by Strategic Agents Using Local Contracts

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Network Creation Games with Disconnected Equilibria

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Bin Packing of Selfish Items

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Three Selfish Spanning Tree Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On Pure and (Approximate) Strong Equilibria of Facility Location Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Efficiency, Fairness and Competitiveness in Nash Bargaining Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Homogeneous Interference Game in Wireless Networks

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Malicious Bayesian Congestion Games

Approximation and Online Algorithms
Stackelberg Strategies and Collusion in Network Games with Splittable Flow

Approximation and Online Algorithms
A comparative analysis of server selection in content replication networks

IEEE/ACM Transactions on Networking (TON)
Coordination mechanisms for selfish scheduling

Theoretical Computer Science
Strongly polynomial-time truthful mechanisms in one shot

Theoretical Computer Science
Intrinsic robustness of the price of anarchy

Proceedings of the forty-first annual ACM symposium on Theory of computing
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract

Proceedings of the forty-first annual ACM symposium on Theory of computing
Effects of parameters on Nash games with OSNR target

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Game theoretic analysis of wireless access network selection: models, inefficiency bounds, and algorithms

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Load balancing in processor sharing systems

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
On a locally minimum cost forwarding game

Proceedings of the 2nd ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Design and evaluation of road pricing: state-of-the-art and methodological advances

Netnomics
Quality of routing congestion games in wireless sensor networks

Proceedings of the 4th Annual International Conference on Wireless Internet
Learning equilibria in repeated congestion games

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The price of democracy in coalition formation

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Equilibrium dynamic systems intelligence

WSEAS Transactions on Information Science and Applications
Equilibrium dynamic systems integration

ICAI'09 Proceedings of the 10th WSEAS international conference on Automation & information
The price of uncertainty

Proceedings of the 10th ACM conference on Electronic commerce
On the price of mediation

Proceedings of the 10th ACM conference on Electronic commerce
Improved Bounds for Facility Location Games with Fair Cost Allocation

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Efficient Methods for Selfish Network Design

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The structure and complexity of Nash equilibria for a selfish routing game

Theoretical Computer Science
Coordination mechanisms

Theoretical Computer Science
Atomic routing games on maximum congestion

Theoretical Computer Science
Algorithmic Game Theory: A Snapshot

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Strong and Pareto Price of Anarchy in Congestion Games

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Load balancing without regret in the bulletin board model

Proceedings of the 28th ACM symposium on Principles of distributed computing
Concurrent imitation dynamics in congestion games

Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed algorithms for QoS load balancing

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Two-terminal routing games with unknown active players

Artificial Intelligence
On the complexity of constrained Nash equilibria in graphical games

Theoretical Computer Science
Efficiency of Scalar-Parameterized Mechanisms

Operations Research
On the Performances of Nash Equilibria in Isolation Games

COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Learning equilibrium in resource selection games

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
K-implementation

Journal of Artificial Intelligence Research
On the value of correlation

Journal of Artificial Intelligence Research
Competitive safety analysis: robust decision-making in multi-agent systems

Journal of Artificial Intelligence Research
Efficiently exploiting symmetries in real time dynamic programming

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On truthfulness and approximation for scheduling selfish tasks

Journal of Scheduling
Mechanism design for set cover games with selfish element agents

Theoretical Computer Science
Eliciting Coordination with Rebates

Transportation Science
Efficient MAC in cognitive radio systems: a game-theoretic approach

IEEE Transactions on Wireless Communications
Simulation analysis of decision-making policy for on-demand transport systems

Applied Intelligence
A survey on networking games in telecommunications

Computers and Operations Research
The Impact of Oligopolistic Competition in Networks

Operations Research
When ignorance helps: Graphical multicast cost sharing games

Theoretical Computer Science
Performance of wireless heterogeneous networks with always-best-connected users

NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
How to find Nash equilibria with extreme total latency in network congestion games?

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Efficiency and stability of Nash equilibria in resource allocation games

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Doing Good with Spam Is Hard

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Equilibria for ADM Minimization Games

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Analysis of an Intentional Fault Which Is Undetectable by Local Checks under an Unfair Scheduler

SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Parametric Packing of Selfish Items and the Subset Sum Algorithm

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Covering Games: Approximation through Non-cooperation

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Maximizing the Minimum Load: The Cost of Selfishness

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Selfish Scheduling with Setup Times

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Strong Nash Equilibria in Games with the Lexicographical Improvement Property

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mediated Equilibria in Load-Balancing Games

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Strong Equilibria in the Max Cut Game

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Stability and Convergence in Selfish Scheduling with Altruistic Agents

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A dynamic approach for load balancing

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
On the base station selection and base station sharing in self-configuring networks

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Two-group knapsack game

Theoretical Computer Science
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation

Theoretical Computer Science
Approximate strong equilibrium in job scheduling games

Journal of Artificial Intelligence Research
Non-cooperative facility location and covering games

Theoretical Computer Science
Price of anarchy in parallel processing

Information Processing Letters
Convergence time to Nash equilibria

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Nashification and the coordination ratio for a selfish routing game

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Selfish routing with oblivious users

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
The hardness of selective network design for bottleneck routing games

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Scheduling to maximize participation

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Information security economics - and beyond

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Nonadaptive selfish routing with online demands

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Selfish routing and path coloring in all-optical networks

CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Nash equilibria in Voronoi games on graphs

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Evolutionary equilibrium in Bayesian routing games: specialization and niche formation

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Tradeoffs and average-case equilibria in selfish routing

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Stackelberg strategies for atomic congestion games

ESA'07 Proceedings of the 15th annual European conference on Algorithms
The price of nash equilibria in multicast transmissions games

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Cost-balancing tolls for atomic network congestion games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the performance of congestion games for optimum satisfiability problems

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
A network creation game with nonuniform interests

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Total latency in singleton congestion games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Priority based load balancing in a self-interested P2P network

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Algorithmic game theory

Communications of the ACM
Game authority for robust and scalable distributed selfish-computer systems

Theoretical Computer Science
Myopic distributed protocols for singleton and independent-resource congestion games

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
On the social cost of distributed selfish content replication

NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Competitive cost sharing with economies of scale

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Better vaccination strategies for better people

Proceedings of the 11th ACM conference on Electronic commerce
Incentive compatibility and dynamics of congestion control

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamics in congestion games

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Load balancing via random local search in closed and open systems

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The price of anarchy in parallel queues revisited

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A system performance approach to OSNR optimization in optical networks

IEEE Transactions on Communications
Socially-aware network design games

INFOCOM'10 Proceedings of the 29th conference on Information communications
Price of anarchy in non-cooperative load balancing

INFOCOM'10 Proceedings of the 29th conference on Information communications
Multi-channel assignment in wireless sensor networks: a game theoretic approach

INFOCOM'10 Proceedings of the 29th conference on Information communications
Rate adaptation games in wireless LANs: nash equilibrium and price of anarchy

INFOCOM'10 Proceedings of the 29th conference on Information communications
Bayesian ignorance

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Stackelberg Routing in Arbitrary Networks

Mathematics of Operations Research
Price war in heterogeneous wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalable byzantine computation

ACM SIGACT News
Colocation games: and their application to distributed resource management

HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Tradeoffs and Average-Case Equilibria in Selfish Routing

ACM Transactions on Computation Theory (TOCT)
Taxes for linear atomic congestion games

ACM Transactions on Algorithms (TALG)
Optimal sensing strategy for opportunistic secondary users in a cognitive radio network

Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Contention resolution under selfishness

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Weighted congestion games: price of anarchy, universal worst-case examples, and tightness

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Computational game theory: an introduction

Algorithms and theory of computation handbook
Analysis of multi-organization scheduling algorithms

Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
A note on symmetry in logic of self-repair: the case of a self-repair network

KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
The impact of altruism on the efficiency of atomic congestion games

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Stressed web environments as strategic games: risk profiles and weltanschauung

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
On the packing of selfish items

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Network uncertainty in selfish routing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
GADIA: A greedy asynchronous distributed interference avoidance algorithm

IEEE Transactions on Information Theory
Mixing time and stationary expected social welfare of logit dynamics

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Pareto efficiency and approximate pareto efficiency in routing and load balancing games

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Improved lower bounds on the price of stability of undirected network design games

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Bottleneck congestion games with logarithmic price of anarchy

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
On the inefficiency of equilibria in linear bottleneck congestion games

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
A game theoretic analysis of network design with socially-aware users

Computer Networks: The International Journal of Computer and Telecommunications Networking
On approximate nash equilibria in network design

WINE'10 Proceedings of the 6th international conference on Internet and network economics
The cost of moral hazard and limited liability in the principal-agent problem

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Braess's paradox in large sparse graphs

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Stackelberg strategies for network design games

WINE'10 Proceedings of the 6th international conference on Internet and network economics
Reducing the maximum latency of selfish ring routing via pairwise cooperations

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Local and global price of anarchy of graphical games

Theoretical Computer Science
Game-theoretic static load balancing for distributed systems

Journal of Parallel and Distributed Computing
Designing Network Protocols for Good Equilibria

SIAM Journal on Computing
Selfish Traffic Allocation for Server Farms

SIAM Journal on Computing
A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks

Wireless Networks
The Price of Fairness

Operations Research
Extending the notion of rationality of selfish agents: Second Order Nash equilibria

Theoretical Computer Science
Routing (un-) splittable flow in games with player-specific affine latency functions

ACM Transactions on Algorithms (TALG)
The price of anarchy in cooperative network creation games

ACM SIGecom Exchanges
An approach to investigating socio-economic tussles arising from building the future internet

The future internet
On the efficiency of equilibria in generalized second price auctions

Proceedings of the 12th ACM conference on Electronic commerce
Optimal cost sharing protocols for scheduling games

Proceedings of the 12th ACM conference on Electronic commerce
On optimal single-item auctions

Proceedings of the forty-third annual ACM symposium on Theory of computing
Dueling algorithms

Proceedings of the forty-third annual ACM symposium on Theory of computing
Inner product spaces for MinSum coordination mechanisms

Proceedings of the forty-third annual ACM symposium on Theory of computing
Mechanism design with uncertain inputs: (to err is human, to forgive divine)

Proceedings of the forty-third annual ACM symposium on Theory of computing
Leading dynamics to good behavior

ACM SIGecom Exchanges
Congestion games with variable demands

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Congestion games with failures

Discrete Applied Mathematics
Collusion in atomic splittable routing games

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Optimal gateway selection in multi-domain wireless networks: a potential game perspective

MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
A cross-layer resource allocation scheme for ICIC in LTE-Advanced

Journal of Network and Computer Applications
On the quality and complexity of pareto equilibria in the job scheduling game

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Social context congestion games

SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Approximation algorithms for a bi-level knapsack problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
On the performances of Nash equilibria in isolation games

Journal of Combinatorial Optimization
Non-cooperative spectrum access in cognitive radio networks: A game theoretical model

Computer Networks: The International Journal of Computer and Telecommunications Networking
How profitable are strategic behaviors in a market?

ESA'11 Proceedings of the 19th European conference on Algorithms
How bad are selfish investments in network security?

IEEE/ACM Transactions on Networking (TON)
The price of forgetting in parallel and non-observable queues

Performance Evaluation
Price of anarchy in non-cooperative load balancing games

Performance Evaluation
Dynamic inefficiency: anarchy without stability

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A clustering coefficient network formation game

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
On the existence of pure strategy nash equilibria in integer-splittable weighted congestion games

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
On dynamics in basic network creation games

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Efficiency of restricted tolls in non-atomic network routing games

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Selfish bin covering

Theoretical Computer Science
Selfish bin coloring

Journal of Combinatorial Optimization
Brief announcement: composition games for distributed systems: the EU grants games

DISC'11 Proceedings of the 25th international conference on Distributed computing
Exact Price of Anarchy for Polynomial Congestion Games

SIAM Journal on Computing
The equilibrium existence problem in finite network congestion games

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Selfish service installation in networks

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Price of anarchy for polynomial wardrop games

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Wardrop equilibria and price of stability for bottleneck games with splittable traffic

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Strongly polynomial-time truthful mechanisms in one shot

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The price of defense and fractional matchings

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Selfish routing and wavelength assignment strategies with advance reservation in inter-domain optical networks

Computer Communications
The curse of simultaneity

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Analysis of selfish behaviors on door-to-door transport system

KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Exact price of anarchy for polynomial congestion games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Towards self-coordinating ubiquitous computing environments

EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
The contribution of game theory to complex systems

PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Atomic routing games on maximum congestion

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Nash equilibria, the price of anarchy and the fully mixed nash equilibrium conjecture

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Braess's paradox, fibonacci numbers, and exponential inapproximability

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the price of anarchy and stability of correlated equilibria of linear congestion games,,

ESA'05 Proceedings of the 13th annual European conference on Algorithms
The hardness of network design for unsplittable flow with selfish users

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
The price of anarchy in selfish multicast routing

CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Interference-aware selfish routing in multi-ratio multi-channel wireless mesh networks

ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Geometric network design with selfish agents

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Coordination mechanisms for selfish scheduling

WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the structure and complexity of worst-case equilibria

WINE'05 Proceedings of the First international conference on Internet and Network Economics
A simple graph-theoretic model for selfish restricted scheduling

WINE'05 Proceedings of the First international conference on Internet and Network Economics
A cost mechanism for fair pricing of resource usage

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Game-Theoretic analysis of internet switching with selfish users

WINE'05 Proceedings of the First international conference on Internet and Network Economics
The price of anarchy of cournot oligopoly

WINE'05 Proceedings of the First international conference on Internet and Network Economics
A graph-theoretic network security game

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Atomic selfish routing in networks: a survey

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Price of anarchy, locality gap, and a network service provider game

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Price of anarchy of network routing games with incomplete information

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Selfish routing in networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
How many parallel TCP sessions to open: a pricing perspective

ICQT'06 Proceedings of the 5th international conference on Internet Charging and QoS Technologies: performability has its Price
Multi-agent based selfish routing for multi-channel wireless mesh networks

PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
Edge pricing of multicommodity networks for selfish users with elastic demands

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Network load games

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Counting stable strategies in random evolutionary games

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On the inefficiency of equilibria in congestion games

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A Stackelberg strategy for routing flow over time

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Local smoothness and the price of anarchy in atomic splittable congestion games

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight bounds for selfish and greedy load balancing

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Routing (un-) splittable flow in games with player-specific linear latency functions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Network games with atomic players

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Atomic congestion games among coalitions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the price of stability for designing undirected networks with fair cost allocations

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The price of approximate stability for scheduling selfish tasks on two links

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Multicast transmissions in non-cooperative networks with a limited number of selfish moves

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Non-cooperative tree creation

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The price of defense

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On nash equilibria in non-cooperative all-optical networks

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
A game theoretical study of access point association in wireless mesh networks

Computer Communications
The max k-cut game and its strong equilibria

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On nash equilibria for multicast transmissions in ad-hoc wireless networks

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Distributed signal estimation in sensor networks where nodes have different interests

Signal Processing
The price of anarchy on uniformly related machines revisited

Information and Computation
The efficiency of optimal taxes

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Congestion games, load balancing, and price of anarchy

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
The price of anarchy in network creation games

ACM Transactions on Algorithms (TALG)
Selfish routing revisited: degeneracy, evolution and stochastic fluctuations

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
More about base station location games

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Adversarial behavior in network mechanism design

Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Tα Παιδíα Παíζϵι the interaction between algorithms and game theory

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Experimental results for stackelberg scheduling strategies

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Uncoordinated load balancing and congestion games in p2p systems

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
On the price of stability for undirected network design

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Evolutionary games: an algorithmic view

Self-star Properties in Complex Information Systems
Introduction

General Theory of Information Transfer and Combinatorics
Non-cooperative facility location and covering games

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On the impact of local taxes in a set cover game

SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Strategic coloring of a graph

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Interplay between security providers, consumers, and attackers: a weighted congestion game approach

GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
Nash equilibria with minimum potential in undirected broadcast games

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
On allocations with negative externalities

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The price of civil society

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
The robust price of anarchy of altruistic games

WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions

ACM Transactions on Computation Theory (TOCT)
Efficiency analysis of load balancing games with and without activation costs

Journal of Scheduling
Intrinsic robustness of the price of anarchy

Communications of the ACM
Competitive contagion in networks

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The price of anarchy in games of incomplete information

Proceedings of the 13th ACM Conference on Electronic Commerce
The price of anarchy for minsum related machine scheduling

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Cache me if you can: capacitated selfish replication games

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The price of anarchy in an exponential multi-server

Operations Research Letters
Profit loss in differentiated oligopolies

Operations Research Letters
Bounding the inefficiency of Nash equilibria in games with finitely many players

Operations Research Letters
Worst-case equilibria

Computer Science Review
Survey: A glimpse at Christos H. Papadimitriou

Computer Science Review
Survey: Nash equilibria: Complexity, symmetries, and approximation

Computer Science Review
The k-server problem

Computer Science Review
Survey: Some results of Christos Papadimitriou on internet structure, network routing, and web information

Computer Science Review
Survey: Robust and scalable middleware for selfish-computer systems

Computer Science Review
Selfish splittable flows and NP-completeness

Computer Science Review
The complexity of welfare maximization in congestion games

Networks
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands

Operations Research Letters
Enforcing efficient equilibria in network design games via subsidies

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Strictly periodic scheduling in IMA-based architectures

Real-Time Systems
Bayesian ignorance

Theoretical Computer Science
Game-theoretic analysis of Internet switching with selfish users

Theoretical Computer Science
Load balancing via random local search in closed and open systems

Queueing Systems: Theory and Applications
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing

SIAM Journal on Discrete Mathematics
Generalized Quantity Competition for Multiple Products and Loss of Efficiency

Operations Research
A Stochastic Competitive R&D Race Where “Winner Takes All”

Operations Research
Competition among telecommunication providers

Telecommunication Economics
Coordination mechanisms for selfish parallel jobs scheduling

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The resource-as-a-service (RaaS) cloud

HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
The effectiveness of stackelberg strategies and tolls for network congestion games

ACM Transactions on Algorithms (TALG)
Contention issues in congestion games

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Selfish overlay network creation and maintenance

IEEE/ACM Transactions on Networking (TON)
Impact of Asynchrony on the Behavior of Rational Selfish Agents

Fundamenta Informaticae
On the existence of nash equilibria in strategic search games

TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Emerge-Sort: swarm intelligence sorting

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
On bidimensional congestion games

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Mobile network creation games

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
On the impact of fair best response dynamics

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On a noncooperative model for wavelength assignment in multifiber optical networks

IEEE/ACM Transactions on Networking (TON)
Sponsored search auctions: an overview of research with emphasis on game theoretic aspects

Electronic Commerce Research
Cooperation in multi-organization scheduling

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Selfish load balancing under partial knowledge

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Extending the notion of rationality of selfish agents: second order Nash equilibria

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Probabilistic techniques in algorithmic game theory

SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Braess's paradox in expanders

Random Structures & Algorithms
Strong price of anarchy for machine load balancing

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Scheduling selfish tasks: about the performance of truthful algorithms

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Selfishness level of strategic games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Basic network creation games with communication interests

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Capacitated network design games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
On the hardness of network design for bottleneck routing games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A theoretical examination of practical game playing: lookahead search

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Incentive engineering for Boolean games

Artificial Intelligence
Bounded-Distance network creation games

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
LP-Based covering games with low price of anarchy

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
The price of anarchy for selfish ring routing is two

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Coordination mechanism for selfish scheduling under a grade of service provision

Information Processing Letters
Optimal Cost Sharing for Resource Selection Games

Mathematics of Operations Research
Non-cooperative games on multidimensional resource allocation

Future Generation Computer Systems
A distributed scheduling framework based on selfish autonomous agents for federated cloud environments

Future Generation Computer Systems
Risk sensitivity of price of anarchy under uncertainty

Proceedings of the fourteenth ACM conference on Electronic commerce
Inefficiency of Nash equilibria with parallel processing policy

Information Processing Letters
Brief announcement: a game-theoretic model motivated by the darpa network challenge

Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Simultaneous auctions are (almost) efficient

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Composable and efficient mechanisms

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Approximate strong equilibria in job scheduling games with two uniformly related machines

Discrete Applied Mathematics
On a generalized Cournot oligopolistic competition game

Journal of Global Optimization
A note on a selfish bin packing problem

Journal of Global Optimization
The Price of Uncertainty

ACM Transactions on Economics and Computation
Approximation algorithms for a bi-level knapsack problem

Theoretical Computer Science
Price of stability in polynomial congestion games

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
On the structure of equilibria in basic network formation

FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Defender (mis)coordination in security games

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Analysis and optimization of multi-dimensional percentile mechanisms

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Invitation games and the price of stability

Proceedings of the 5th conference on Innovations in theoretical computer science
Coordination mechanisms from (almost) all scheduling policies

Proceedings of the 5th conference on Innovations in theoretical computer science
Social context congestion games

Theoretical Computer Science
User satisfaction in competitive sponsored search

Proceedings of the 23rd international conference on World wide web
On the hardness of network design for bottleneck routing games

Theoretical Computer Science
A game-theoretic approach to stable routing in max-min fair networks

IEEE/ACM Transactions on Networking (TON)
The cost of selfishness for maximizing the minimum load on uniformly related machines

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.12

Visualization

Abstract

In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the effectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents share a very simple network leads to some interesting mathematics, results, and open problems.