Inefficiency of Nash equilibria
Mathematics of Operations Research
The mathematics of nonlinear programming
The mathematics of nonlinear programming
Data networks (2nd ed.)
Competitive routing in multiuser communication networks
IEEE/ACM Transactions on Networking (TON)
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
Stackelberg scheduling strategies
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Designing Networks for Selfish Users is Hard
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
The price of anarchy is independent of the network topology
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
On the performance of user equilibria in traffic networks
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 4th ACM conference on Electronic commerce
How much can taxes help selfish routing?
Proceedings of the 4th ACM conference on Electronic commerce
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 9th annual international conference on Mobile computing and networking
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
The maximum latency of selfish routing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The complexity of pure Nash equilibria
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
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
Experiences applying game theory to system design
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
On the benefits and feasibility of incentive based routing infrastructure
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
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 anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce
Congestion games with failures
Proceedings of the 6th ACM conference on Electronic commerce
Fast convergence of selfish rerouting
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Selfish routing with atomic players
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive routing with stale information
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
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
Beyond VCG: Frugality of Truthful Mechanisms
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Interaction of overlay networks: properties and implications
ACM SIGMETRICS Performance Evaluation Review - Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
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
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
On the interaction of multiple overlay routing
Performance Evaluation - Performance 2005
ACM SIGACT News
The effect of collusion in congestion games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast convergence to Wardrop equilibria by adaptive sampling methods
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)
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
Braess's paradox in large random graphs
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
A mathematical model for the TCP tragedy of the commons
Theoretical Computer Science - Game theory meets theoretical computer science
Dynamic overlay routing based on available bandwidth estimation: a simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
How much can taxes help selfish routing?
Journal of Computer and System Sciences - Special issue on network algorithms 2005
A BGP-based mechanism for lowest-cost routing
Distributed Computing - Special issue: PODC 02
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal overload response in sensor networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
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
Joint Optimization of MAC and Network Coding for Cooperative and Competitive Wireless Multicasting
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 2
Tradeoffs in worst-case equilibria
Theoretical Computer Science - Approximation and online algorithms
Tight bounds for worst-case equilibria
ACM Transactions on Algorithms (TALG)
On the price of anarchy in unbounded delay networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
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
Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
Mathematics of Operations Research
The price of anarchy for polynomial social cost
Theoretical Computer Science
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
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 malicious players
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
Negotiation-based routing between neighboring ISPs
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation
IEEE Transactions on Parallel and Distributed Systems
A game theoretic comparison of TCP and digital fountain based protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
The effectiveness of Stackelberg strategies and tolls for network congestion games
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Multihoming route control among a group of multihomed stub networks
Computer Communications
Routing games with an unknown set of active players
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Minimizing average latency in oblivious routing
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
Scalable real-time gateway assignment in mobile mesh networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
A joint selfish routing and channel assignment game in wireless mesh networks
Computer Communications
REPLEX: dynamic traffic engineering based on wardrop routing policies
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Selfishness, collusion and power of local search for the ADMs minimization problem
Computer Networks: The International Journal of Computer and Telecommunications Networking
Inapproximability of pure nash equilibria
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
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
Optimal envy-free pricing with metric substitutability
Proceedings of the 9th ACM conference on Electronic commerce
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
On the windfall of friendship: inoculation strategies on social networks
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
Game-theoretic recommendations: some progress in an uphill battle
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
User-directed routing: from theory, towards practice
Proceedings of the 3rd international workshop on Economics of networked systems
Cooperative content distribution and traffic engineering
Proceedings of the 3rd international workshop on Economics of networked systems
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
Computing Approximate Nash Equilibria in Network Congestion 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
Computers & Mathematics with Applications
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
The resource pooling principle
ACM SIGCOMM Computer Communication Review
The effect of local scheduling in load balancing designs
ACM SIGMETRICS Performance Evaluation Review
Artificial Intelligence
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
Sensitivity of Wardrop Equilibria
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
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Equilibria of atomic flow games are not unique
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Stackelberg Routing in Arbitrary Networks
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
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
Malicious Bayesian Congestion Games
Approximation and Online Algorithms
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
Approximation and Online Algorithms
Stabilization of the minimum latency flow in Braess graphs by state-dependent tax
Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
A comparative analysis of server selection in content replication networks
IEEE/ACM Transactions on Networking (TON)
Intrinsic robustness of the price of anarchy
Proceedings of the forty-first annual ACM symposium on Theory of computing
EGOIST: overlay routing using selfish neighbor selection
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
Quality of routing congestion games in wireless sensor networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Cooperative content distribution and traffic engineering in an ISP network
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
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 anarchy in bertrand games
Proceedings of the 10th ACM conference on Electronic commerce
Management of Variable Data Streams in Networks
Algorithmics of Large and Complex Networks
Efficient Methods for Selfish Network Design
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Adaptive routing with stale information
Theoretical Computer Science
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
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
Two-terminal routing games with unknown active players
Artificial Intelligence
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Competitive safety analysis: robust decision-making in multi-agent systems
Journal of Artificial Intelligence Research
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Eliciting Coordination with Rebates
Transportation Science
A survey on networking games in telecommunications
Computers and Operations Research
A paradox in optimal flow control of M/M/n queues
Computers and Operations Research
The Impact of Oligopolistic Competition in Networks
Operations Research
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
Uplink power control and base station association in multichannel cellular networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Traffic engineering, content distribution, and continuous potential games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for 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
On the efficiency of sequential auctions for spectrum sharing
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
Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Maximizing the Minimum Load: The Cost of Selfishness
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nash Dynamics in Congestion Games with Similar Resources
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
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
Wardrop Equilibria with Risk-Averse Users
Transportation Science
Coordination by design and the price of autonomy
Autonomous Agents and Multi-Agent Systems
Non-cooperative facility location and covering games
Theoretical Computer Science
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Selfish routing with oblivious users
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
A survey of uniqueness results for selfish routing
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
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
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
Cost-balancing tolls for atomic network congestion games
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
Selfishness, collusion and power of local search for the ADMs minimization problem
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
Communications of the ACM
Buyer-supplier games: optimization over the core
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Price of anarchy for cognitive MAC games
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
TCP throughput adaptation in WiMax networks using replicator dynamics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
IEEE Journal on Selected Areas in Communications
Asymptotically optimal control of parallel tandem queues with loss
Queueing Systems: Theory and Applications
Stackelberg Routing in Arbitrary Networks
Mathematics of Operations Research
Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Colocation games: and their application to distributed resource management
HotCloud'09 Proceedings of the 2009 conference on Hot topics in cloud computing
Self-organized traffic control
Proceedings of the seventh ACM international workshop on VehiculAr InterNETworking
Taxes for linear atomic congestion games
ACM Transactions on Algorithms (TALG)
User equilibria for a parallel queueing system with state dependent routing
Queueing Systems: Theory and Applications
Price of anarchy for greedy auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Computational game theory: an introduction
Algorithms and theory of computation handbook
Towards microeconomic resources allocation in overlay networks
AMT'10 Proceedings of the 6th international conference on Active media technology
Equilibrium Results for Dynamic Congestion Games
Transportation Science
On the packing of selfish items
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An interference and load aware routing metric for Wireless Mesh Networks
International Journal of Ad Hoc and Ubiquitous Computing
Bottleneck congestion games with logarithmic price of anarchy
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Braess's paradox for flows over time
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
An economic case for end system multicast
FIS'10 Proceedings of the Third future internet conference on Future internet
Buyer-games: Optimization over the core
Theoretical Computer Science
Braess's paradox in large sparse graphs
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Coalition formation and price of anarchy in cournot oligopolies
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The good, the bad and the cautious: safety level cooperative 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
Selfish Traffic Allocation for Server Farms
SIAM Journal on Computing
Equilibrium of heterogeneous congestion control: optimality and stability
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Journal of Network and Systems Management
Operations Research
An adaptive control technique for a connection weight of agents in a self-repairing network
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
Theoretical Computer Science
Mutually controlled routing with independent ISPs
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
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
Road traffic optimisation using an evolutionary game
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Congestion games with failures
Discrete Applied Mathematics
Design space analysis for modeling incentives in distributed systems
Proceedings of the ACM SIGCOMM 2011 conference
Restoring pure equilibria to weighted congestion games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Social context congestion games
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Competition yields efficiency in load balancing games
Performance Evaluation
Improving the price of anarchy for selfish routing via coordination mechanisms
ESA'11 Proceedings of the 19th European conference on Algorithms
How bad are selfish investments in network security?
IEEE/ACM Transactions on Networking (TON)
On cooperative settlement between content, transit, and eyeball internet service providers
IEEE/ACM Transactions on Networking (TON)
The implication of overlay routing on ISPs' connecting strategies
Proceedings of the 23rd International Teletraffic Congress
Toward microeconomic allocation of resources in multi-service overlay networks
Journal of Computer and Systems Sciences International
Dynamic inefficiency: anarchy without stability
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
The price of optimum in a matching 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
Strategic pricing in next-hop routing with elastic demands
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
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
A strategy distribution of a self-repairing network in dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Adaptive strategies: toward a design of adaptive systems for dynamic environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
Optimal Envy-Free Pricing with Metric Substitutability
SIAM Journal on Computing
Exact Price of Anarchy for Polynomial Congestion Games
SIAM Journal on Computing
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
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
The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games
Operations Research
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Can altruism spare energy in ad hoc networking?
Proceedings of the 9th International Conference on Advances in Mobile Computing and Multimedia
Exact price of anarchy for polynomial congestion games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Convergence and approximation in potential games
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
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
The efficiency and fairness of a fixed budget resource allocation game
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 complexity of games on highly regular graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Symmetry in network congestion games: pure equilibria and anarchy cost
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Computer Networks: The International Journal of Computer and Telecommunications 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
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
Atomic selfish routing in networks: a survey
WINE'05 Proceedings of the First international conference on Internet and Network Economics
New results on the complexity of uniformly mixed nash equilibria
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
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Resilient multi-path routing based on a biological attractor selection scheme
BioADIT'06 Proceedings of the Second international conference on Biologically Inspired Approaches to Advanced Information Technology
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
Monotonicity properties of user equilibrium policies for parallel batch systems
Queueing Systems: Theory and Applications
Edge pricing of multicommodity networks for selfish users with elastic demands
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
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
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
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
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
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
Pricing network edges to cross a river
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
On nash equilibria for multicast transmissions in ad-hoc wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
Selfish routing revisited: degeneracy, evolution and stochastic fluctuations
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
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A systemic payoff in a self-repairing network
Artificial Life and Robotics
On the price of stability for undirected network design
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Competitive online multicommodity routing
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The price of collusion in series-parallel networks
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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
Convergence and approximation in potential games
Theoretical Computer Science
Stable and efficient pricing for inter-domain traffic forwarding
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Profit loss in differentiated oligopolies
Operations Research Letters
Bounding the inefficiency of Nash equilibria in games with finitely many players
Operations Research Letters
The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
Operations Research Letters
Operations Research Letters
Statistical behaviors of mobile agents in network routing
The Journal of Supercomputing
Efficient methods for selfish network design
Theoretical Computer Science
Pairwise cooperations in selfish ring routing for minimax linear latency
Theoretical Computer Science
ACM SIGecom Exchanges
Co-evolution of the dynamics in population games: the case of traffic flow assignment
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
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
The effectiveness of stackelberg strategies and tolls for network congestion games
ACM Transactions on Algorithms (TALG)
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Minimizing rosenthal potential in multicast games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
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)
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
Random Structures & Algorithms
Approximating wardrop equilibria with finitely many agents
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Strong price of anarchy for machine load balancing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A bicriteria approximation for the reordering buffer problem
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Capacitated network design games
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Traffic engineering with semiautonomous users: a game-theoretic perspective
IEEE/ACM Transactions on Networking (TON)
The price of anarchy for selfish ring routing is two
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Convergence of best-response dynamics in games with conflicting congestion effects
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
Future Generation Computer Systems
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
Defender (mis)coordination in security games
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
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
Social context congestion games
Theoretical Computer Science
Journal of Combinatorial Optimization
Strategic Pricing in Next-Hop Routing with Elastic Demands
Theory of Computing Systems
On the Windfall and price of friendship: Inoculation strategies on social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.05 |
We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times---the total latency---is minimized.In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a "selfishly motivated" assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance.In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and nondecreasing in the edge congestion. Here, the total latency of the routes chosen by unregulated selfish network users may be arbitrarily larger than the minimum possible total latency; however, we prove that it is no more than the total latency incurred by optimally routing twice as much traffic.