Worst-case equilibria

zbMATH Open1099.91501MaRDI QIDQ3409969FDOQ3409969

Authors: Elias Koutsoupias, Christos Papadimitriou 

Publication date: 21 November 2006

Recommendations

• Worst-case equilibria
• Tradeoffs in worst-case equilibria
• Approximation and Online Algorithms
• The price of selfish routing
• The price of selfish routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Special types of economic equilibria (91B52) Network design and communication in computer systems (68M10)

Cited In (only showing first 100 items - show all)

• Facets of the fully mixed Nash equilibrium conjecture
• A new lower bound on the price of anarchy of selfish bin packing
• Using weight decision for decreasing the price of anarchy in selfish bin packing games
• How to find Nash equilibria with extreme total latency in network congestion games?
• Toll caps in privatized road networks
• A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
• Performance of non-cooperative routing over parallel non-observable queues
• Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
• Tight inefficiency bounds for perception-parameterized affine congestion games
• Achieving target equilibria in network routing games without knowing the latency functions
• The curse of sequentiality in routing games
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss
• Agent incentives of a proportional sharing mechanism in resource sharing
• The buck-passing game
• Risk-based models for emergency shelter and exit design in buildings
• A coordination mechanism for a scheduling game with uniform-batching machines
• Bounding the inefficiency of compromise in opinion formation
• Scheduling to Maximize Participation
• Edge pricing of multicommodity networks for selfish users with elastic demands
• Strongly polynomial-time truthful mechanisms in one shot
• Linear-quadratic mean-field-type games: a direct method
• Collusion in atomic splittable routing games
• Online learning of Nash equilibria in congestion games
• Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
• Decentralized subcontractor scheduling with divisible jobs
• On cost sharing in the provision of a binary and excludable public good
• Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
• Capacitated network design games
• Inefficiency of games with social context
• Cost sharing in production economies
• A network pricing game for selfish traffic
• Price of anarchy in parallel processing
• Multistage interval scheduling games
• Competitive contagion in networks
• Distributed Learning of Wardrop Equilibria
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games
• Schelling games on graphs
• Evaluating the effect of sub-optimality
• Altruistic Hedonic Games
• Scheduling to maximize participation
• On network formation games with heterogeneous players and basic network creation games
• On network formation games with heterogeneous players and basic network creation games
• The intermediate price of anarchy (IPoA) in bin packing games
• Facets of the Fully Mixed Nash Equilibrium Conjecture
• The price of anarchy of affine congestion games with similar strategies
• Cost sharing mechanisms for fair pricing of resource usage
• Equilibrium computation of the Hart and Mas-Colell bargaining model
• A multiple access game with incomplete information
• Resilience of routing in parallel link networks
• Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
• Modelling web-service uncertainty: the angel/daemon approach
• Nash equilibrium based fairness
• A review of transport market modeling using game-theoretic principles
• On the price of anarchy of two-stage machine scheduling games
• The Influence of Link Restrictions on (Random) Selfish Routing
• Extending the notion of rationality of selfish agents: second order Nash equilibria
• The Price of Nash Equilibria in Multicast Transmissions Games
• Selfish load balancing for jobs with favorite machines
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Magnitude of inefficiency
• Equilibria for networks with malicious users
• Competitive Cost Sharing with Economies of Scale
• Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
• The impact of local policies on the quality of packet routing in paths, trees, and rings
• On the complexity of constrained Nash equilibria in graphical games
• The price of anarchy for utilitarian scheduling games on related machines
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• Nash equilibria in discrete routing games with convex latency functions
• Connectivity and equilibrium in random games
• Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
• Bayesian ignorance
• On the (in)efficiency of MFG equilibria
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• Transportation network with externalities
• Two-terminal routing games with unknown active players
• Price of Anarchy in Networks with Heterogeneous Latency Functions
• Fragility of the commons under prospect-theoretic risk attitudes
• On the price of anarchy of highly congested nonatomic network games
• Linear tolls suffice: new bounds and algorithms for tolls in single source networks
• Sensitivity of Wardrop Equilibria
• Eisenberg-Gale markets: algorithms and game-theoretic properties
• Selfish versus unselfish optimization of network creation
• Mechanism design for set cover games with selfish element agents
• Price of anarchy for parallel link networks with generalized mean objective
• On the robustness of the approximate price of anarchy in generalized congestion games
• Sensitivity of Wardrop equilibria
• Local and global price of anarchy of graphical games
• On Stackelberg strategies in affine congestion games
• Game-theoretic static load balancing for distributed systems
• The Price of Stochastic Anarchy
• Topological price of anarchy bounds for clustering games on networks
• Congestion games with complementarities
• Stackelberg Strategies and Collusion in Network Games with Splittable Flow
• Coordination mechanisms for scheduling selfish jobs with favorite machines
• Ranking games
• When Ignorance Helps: Graphical Multicast Cost Sharing Games
• The price of anarchy for polynomial social cost
• Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
• Selfish bin covering

This page was built for publication: Worst-case equilibria

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3409969)