Algorithms, games, and the internet

Authors:
Christos Papadimitriou
Affiliations:
University of California, Berkeley
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 18
Cited 322

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
On the complexity of cooperative solution concepts

Mathematics of Operations Research
On complexity as bounded rationality (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Segmentation problems

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Algorithmic mechanism design (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Alternation

Journal of the ACM (JACM)
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
Sharing the cost of muliticast transmissions (preliminary version)

STOC '00 Proceedings of the thirty-second 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
Nash Convergence of Gradient Dynamics in General-Sum Games

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Optimization problems in congestion control

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
How bad is selfish routing?

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the value of private information

TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Algorithms for selfish agents mechanism design for distributed computation

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

How bad is selfish routing?

Journal of the ACM (JACM)
On the complexity of equilibria

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Competitive generalized auctions

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
Frugal path mechanisms

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Distributed algorithmic mechanism design: recent results and future directions

DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Competitiveness via consensus

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Improved Results for Stackelberg Scheduling Strategies

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Discrete Subexponential Algorithm for Parity Games

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
The Price of Truth: Frugality in Truthful Mechanisms

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
DNA Starts to Learn Poker

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract

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
A polynomial-time nash equilibrium algorithm for repeated games

Proceedings of the 4th ACM conference on Electronic commerce
On the core of the multicommodity flow game

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
Near-optimal network design with selfish agents

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Game-Theoretic Approach for Binding in Behavioral Synthesis

VLSID '03 Proceedings of the 16th International Conference on VLSI Design
Incentive compatible multi unit combinatorial auctions

Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Miscomputing ratio: social cost of selfish computing

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
On the complexity of price equilibria

Journal of Computer and System Sciences - STOC 2002
The price of anarchy is independent of the network topology

Journal of Computer and System Sciences - STOC 2002
Appraising two decades of distributed computing theory research

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
The Digitization of Word of Mouth: Promise and Challenges of Online Feedback Mechanisms

Management Science
Frugality in path auctions

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Mechanism design for online real-time scheduling

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Strategic deliberation and truthful revelation: an impossibility result

EC '04 Proceedings of the 5th ACM conference on Electronic commerce
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
Network games

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results

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
Communication complexity as a lower bound for learning in games

ICML '04 Proceedings of the twenty-first international conference on Machine learning
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
Near rationality and competitive equilibria in networked systems

Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Cryptography and mechanism design

TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Network QoS games: stability vs optimality tradeoff

Journal of Computer and System Sciences
Computing Nash equilibria of action-graph games

UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
The computation of market equilibria

ACM SIGACT News
Coordination mechanisms for congestion games

ACM SIGACT News
Computing correlated equilibria in multi-player games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
On the core of the multicommodity flow game

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
A polynomial-time Nash equilibrium algorithm for repeated games

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
An economic model of the worldwide web

WWW '05 Special interest tracks and posters of the 14th international conference on World Wide Web
Complexity of (iterated) dominance

Proceedings of the 6th ACM conference on Electronic commerce
A price-anticipating resource allocation mechanism for distributed shared clusters

Proceedings of the 6th ACM conference on Electronic commerce
On decentralized incentive compatible mechanisms

Proceedings of the 6th ACM conference on Electronic commerce
Computing equilibria in multi-player games

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the computational complexity of Nash equilibria for (0, 1) bimatrix games

Information Processing Letters
The price of selfish behavior in bilateral network formation

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
Iterative Dutch combinatorial auctions

Annals of Mathematics and Artificial Intelligence
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretical and cryptographic techniques

Proceedings of the 11th annual international conference on Mobile computing and networking
Fair Bandwidth Sharing in Distributed Systems: A Game-Theoretic Approach

IEEE Transactions on Computers
BAR fault tolerance for cooperative services

Proceedings of the twentieth ACM symposium on Operating systems principles
On the Complexity of Two-PlayerWin-Lose Games

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Nash Equilibria in Random Games

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Query Incentive Networks

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
Two-player nonzero-sum ω-regular games

CONCUR 2005 - Concurrency Theory
On the complexity of market equilibria with maximum social welfare

Information Processing Letters
Post-Layout Gate Sizing for Interconnect Delay and Crosstalk Noise Optimization

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
The effect of collusion in congestion games

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Combinatorial agency

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
Computing the optimal strategy to commit to

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Playing games in many possible worlds

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Computational-Mechanism Design: A Call to Arms

IEEE Intelligent Systems
A mathematical model for the TCP tragedy of the commons

Theoretical Computer Science - Game theory meets theoretical computer science
On the approximability of the range assignment problem on radio networks in presence of selfish agents

Theoretical Computer Science - Game theory meets theoretical computer science
Structure and complexity of extreme Nash equilibria

Theoretical Computer Science - Game theory meets theoretical computer science
Complexity of constructing solutions in the core based on synergies among coalitions

Artificial Intelligence
A game-theoretic framework for multimetric optimization of interconnect delay, power, and crosstalk noise during wire sizing

Proceedings of the 41st annual Design Automation Conference
How much can taxes help selfish routing?

Journal of Computer and System Sciences - Special issue on network algorithms 2005
On certain connectivity properties of the internet topology

Journal of Computer and System Sciences - Special issue on FOCS 2003
Distributed social systems

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
When selfish meets evil: byzantine players in a virus inoculation game

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the topologies formed by selfish peers

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Decentralized utility-based sensor network design

Mobile Networks and Applications
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
Social networks, incentives, and search

SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
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
Simultaneous Interconnect Delay and Crosstalk Noise Optimization through Gate Sizing Using Game Theory

IEEE Transactions on Computers
Strategyproof mechanisms towards dynamic topology formation in autonomous networks

Mobile Networks and Applications
A technique for reducing normal-form games to compute a Nash equilibrium

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Combinatorial structure and randomized subexponential algorithms for infinite games

Theoretical Computer Science
Tradeoffs in worst-case equilibria

Theoretical Computer Science - Approximation and online algorithms
Frugal path mechanisms

ACM Transactions on Algorithms (TALG)
Tight bounds for worst-case equilibria

ACM Transactions on Algorithms (TALG)
Modeling energy constrained routing in selfish ad hoc networks

GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
On the price of anarchy in unbounded delay networks

GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
Reputation in self-organized communication systems and beyond

Interperf '06 Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems
Realising Common Knowledge Assumptions in Agent Auctions

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
AWESOME: A general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents

Machine Learning
The price of anarchy for polynomial social cost

Theoretical Computer Science
Sharing the cost of multicast transmissions in wireless networks

Theoretical Computer Science
A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property

Theoretical Computer Science
First to market is not everything: an analysis of preferential attachment with fitness

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proportional response dynamics leads to market equilibrium

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
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 price of anarchy in network creation games

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Network formation games with local coalitions

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Convergence to approximate Nash equilibria in congestion games

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
Games of fixed rank: a hierarchy of bimatrix games

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Applying game theory mechanisms in open agent systems with complete information

Autonomous Agents and Multi-Agent Systems
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Maximum-lifetime routing: system optimization & game-theoretic perspectives

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On designing incentive-compatible routing and forwarding protocols in wireless ad-hoc networks: an integrated approach using game theoretic and cryptographic techniques

Wireless Networks
An incentive mechanism for message relaying in unstructured peer-to-peer systems

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Mixed Nash equilibria in selfish routing problems with dynamic constraints

Theoretical Computer Science
A Pricing Mechanism for Resource Management in Grid Computing

Computational Economics
A joint selfish routing and channel assignment game in wireless mesh networks

Computer Communications
Impact of Asynchrony on the Behavior of Rational Selfish Agents

Fundamenta Informaticae
Competitions and dynamics of duopoly wireless service providers in dynamic spectrum market

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A game-theoretic analysis of wireless access point selection by mobile users

Computer Communications
Fast convergence to nearly optimal solutions in potential games

Proceedings of the 9th ACM conference on Electronic commerce
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
Do humans identify efficient strategies in structured peer-to-peer systems?

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Evolutionary dynamics for designing multi-period auctions

Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games

SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Selfish Bin Packing

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Nash equilibria in discrete routing games with convex latency functions

Journal of Computer and System Sciences
On domination game analysis for microeconomic data mining

ACM Transactions on Knowledge Discovery from Data (TKDD)
Approximate Equilibria for Strategic Two Person Games

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
Window-Games between TCP Flows

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Frugal Routing on Wireless Ad-Hoc Networks

SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Online vs. Offline Behavior: How to Design Strategic Agents for Distributed Coordinator-Free Environments

WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
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
Dual Payoffs, Core and a Collaboration Mechanism Based on Capacity Exchange Prices in Multicommodity Flow Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
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
Conflicting Congestion Effects in Resource Allocation Games

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Local Two-Stage Myopic Dynamics for Network Formation Games

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
Buffered cross-bar switches, revisited: design steps, proofs and simulations towards optimal rate and minimum buffer memory

IEEE/ACM Transactions on Networking (TON)
Settling the complexity of computing two-player Nash equilibria

Journal of the ACM (JACM)
Strongly polynomial-time truthful mechanisms in one shot

Theoretical Computer Science
Quality of routing congestion games in wireless sensor networks

Proceedings of the 4th Annual International Conference on Wireless Internet
MapReduce optimization using regulated dynamic prioritization

Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Coordination mechanisms

Theoretical Computer Science
Atomic routing games on maximum congestion

Theoretical Computer Science
Simple search methods for finding a Nash equilibrium

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
A generalized strategy eliminability criterion and computational methods for applying it

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Fast and compact: a simple class of congestion games

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Mixed-integer programming methods for finding Nash equilibria

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
K-implementation

Journal of Artificial Intelligence Research
On the value of correlation

Journal of Artificial Intelligence Research
Infeasibility certificates and the complexity of the core in coalitional games

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Routing mediators

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
How hard is it to find extreme Nash equilibria in network congestion games?

Theoretical Computer Science
Complexity results about Nash equilibria

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Complexity of constructing solutions in the core based on synergies among coalitions

Artificial Intelligence
Eliciting Coordination with Rebates

Transportation Science
Power allocation games for MIMO multiple access channels with coordination

IEEE Transactions on Wireless Communications
An incentive mechanism for message relaying in unstructured peer-to-peer systems

Electronic Commerce Research and Applications
The price of stability in selfish scheduling games

Web Intelligence and Agent Systems
The Impact of Oligopolistic Competition in Networks

Operations Research
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
Combinatorial agency with audits

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Power control game in protected and shared bands: manipulability of Nash equilibrium

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
On Equilibria for ADM Minimization Games

SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Resource allocation in protected and shared bands: uniqueness and efficiency of Nash equilibria

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
A polynomial-time Nash equilibrium algorithm for repeated games

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
On the core of the multicommodity flow game

Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
On the computational complexity of Nash equilibria for (0,1) bimatrix games

Information Processing Letters
On the complexity of market equilibria with maximum social welfare

Information Processing Letters
Approximate strong equilibrium in job scheduling games

Journal of Artificial Intelligence Research
Coordination by design and the price of autonomy

Autonomous Agents and Multi-Agent Systems
Non-cooperative facility location and covering games

Theoretical Computer Science
Nashification and the coordination ratio for a selfish routing game

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Double auction in two-level markets

ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
Admissibility in infinite games

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Assume-guarantee synthesis

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Hierarchical density-based clustering of categorical data and a simplification

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining
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
On the performance of congestion games for optimum satisfiability problems

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Incentive-compatible interdomain routing with linear utilities

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
False-name-proof mechanisms for hiring a team

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Extending polynomial time computability to markets with demand correspondences

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Characterizing truthful market design

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Truthful resource allocation in selfish sensor web

MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Buyer-supplier games: optimization over the core

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Window-games between TCP flows

Theoretical Computer Science
A collusion-resistant routing scheme for noncooperative wireless ad hoc networks

IEEE/ACM Transactions on Networking (TON)
Analysis of duopoly price competition between WLAN providers

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A novel method for strategy acquisition and its application to a double-auction market game

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on game theory
Market-based control of computational systems: introduction to the special issue

Autonomous Agents and Multi-Agent Systems
Evolutionary mechanism design: a review

Autonomous Agents and Multi-Agent Systems
Bayesian ignorance

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Avoiding the prisoner's dilemma in auction-based negotiations for highly rugged utility spaces

Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
A multidimensional procurement auction for trading composite services

Electronic Commerce Research and Applications
Computing Nash equilibria gets harder: new results show hardness even for parameterized complexity

CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Taxes for linear atomic congestion games

ACM Transactions on Algorithms (TALG)
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
The impact of altruism on the efficiency of atomic congestion games

TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Network uncertainty in selfish routing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
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
The networked common goods game

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
The Price of Fairness

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

Theoretical Computer Science
Power allocation games in interference relay channels: existence analysis of nash equilibria

EURASIP Journal on Wireless Communications and Networking
The price of anarchy in cooperative network creation games

ACM SIGecom Exchanges
On the efficiency of equilibria in generalized second price auctions

Proceedings of the 12th ACM conference on Electronic commerce
Rank-1 bimatrix games: a homeomorphism and a polynomial time algorithm

Proceedings of the forty-third annual ACM symposium on Theory of computing
Herding in Queues with Waiting Costs: Rationality and Regret

Manufacturing & Service Operations Management
Congestion games with failures

Discrete Applied Mathematics
Equilibria problems on games: Complexity versus succinctness

Journal of Computer and System Sciences
The complexity of game isomorphism

Theoretical Computer Science
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
Stochastic selfish routing

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Bounded budget betweenness centrality game for strategic network formations

Theoretical Computer Science
Query incentive networks

ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
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
Strongly polynomial-time truthful mechanisms in one shot

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
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
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
The hardness of network design for unsplittable flow with selfish users

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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
Concurrent games with tail objectives

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A primal-dual algorithm for computing fisher equilibrium in the absence of gross substitutability property

WINE'05 Proceedings of the First international conference on Internet and Network Economics
Experiments with an economic model of the worldwide web

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
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
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
Price of anarchy of network routing games with incomplete information

WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Addressing stability issues in mediated complex contract negotiations for constraint-based, non-monotonic utility spaces

Autonomous Agents and Multi-Agent Systems
Network game with attacker and protector entities

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Polynomial space suffices for deciding nash equilibria properties for extensive games with large trees,

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
Tight bounds for selfish and greedy load balancing

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
Pure nash equilibria in games with a large number of actions

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Truthful approximation mechanisms for scheduling selfish related machines

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Deterministic monotone algorithms for scheduling on related machines

WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Bounding the payment of approximate truthful mechanisms

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
The price of anarchy on uniformly related machines revisited

Information and Computation
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)
Welfare engineering in practice: on the variety of multiagent resource allocation problems

ESAW'04 Proceedings of the 5th international conference on Engineering Societies in the Agents World
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
Computing equilibria using interval constraints

CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Designing auctions for deliberative agents

AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
An overview of cooperative and competitive multiagent learning

LAMAS'05 Proceedings of the First international conference on Learning and Adaption in Multi-Agent Systems
Parameterized two-player nash equilibrium

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
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
Convergence and approximation in potential games

Theoretical Computer Science
The price of anarchy for minsum related machine scheduling

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
The price of anarchy in an exponential multi-server

Operations Research Letters
Recent development in computational complexity characterization of Nash equilibrium

Computer Science Review
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
Survey: Some results of Christos Papadimitriou on internet structure, network routing, and web information

Computer Science Review
Selfish splittable flows and NP-completeness

Computer Science Review
Enforcing efficient equilibria in network design games via subsidies

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Pairwise cooperations in selfish ring routing for minimax linear latency

Theoretical Computer Science
Bayesian ignorance

Theoretical Computer Science
Computing optimal contracts in combinatorial agencies

Theoretical Computer Science
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing

SIAM Journal on Discrete Mathematics
Conflicting Congestion Effects in Resource Allocation Games

Operations Research
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
Well supported approximate equilibria in bimatrix games: a graph theoretic approach

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
Braess's paradox in expanders

Random Structures & Algorithms
Efficient algorithms for constant well supported approximate equilibria in bimatrix games

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Finding pure nash equilibrium of graphical game via constraints satisfaction approach

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Capacitated network design games

SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Convergence of best-response dynamics in games with conflicting congestion effects

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Task graph pre-scheduling, using Nash equilibrium in game theory

The Journal of Supercomputing
On the complexity of trial and error

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
Algorithms, networks, and social phenomena

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A game-theoretic analysis of preventing spam over Internet Telephony via audio CAPTCHA-based authentication

Journal of Computer Security
On the Windfall and price of friendship: Inoculation strategies on social networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.03

Visualization

Abstract

If the Internet is the next great subject for Theoretical Computer Science to model and illuminate mathematically, then Game Theory, and Mathematical Economics more generally, are likely to prove useful tools. In this talk I survey some opportunities and challenges in this important frontier.