Worst-case equilibria

DOI10.1016/J.COSREV.2009.04.003zbMATH Open1303.91012OpenAlexW2056606651WikidataQ56386815 ScholiaQ56386815MaRDI QIDQ458478FDOQ458478

Authors: Elias Koutsoupias, Christos Papadimitriou 

Publication date: 7 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2009.04.003

Recommendations

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

zbMATH Keywords

Nash eqilibria

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Noncooperative games (91A10) 2-person games (91A05) (n)-person games, (n>2) (91A06) Network design and communication in computer systems (68M10)

Cites Work

• Algorithmic Game Theory
• Worst-case equilibria
• Title not available (Why is that?)
• Approximate equilibria and ball fusion
• Bounds for List Schedules on Uniform Processors
• Algorithms, games, and the internet
• Algorithmic mechanism design (extended abstract)
• Game theory
• On complexity as bounded rationality (extended abstract)
• Title not available (Why is that?)
• Optimal routing control: repeated game approach
• On the existence of equilibria in noncooperative optimal flow control

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

• Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011
• Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research
• Title not available (Why is that?)
• Mixed coordination mechanisms for scheduling games on hierarchical machines
• On understanding price-QoS war for competitive market and confused consumers
• Timed network games with clocks
• Implementation of optimal schedules in outsourcing with identical suppliers
• Non-blind strategies in timed network congestion games
• Timed network games
• Cost-sharing in generalised selfish routing
• Risk-averse selfish routing
• Performance guarantees of local search for minsum scheduling problems
• Tight welfare guarantees for pure Nash equilibria of the uniform price auction
• The inefficiency of Nash and subgame perfect equilibria for network routing
• The price of anarchy and stability in general noisy best-response dynamics
• Location Games on Networks: Existence and Efficiency of Equilibria
• Improving the price of anarchy for selfish routing via coordination mechanisms
• Window-games between TCP flows
• An abstraction-refinement methodology for reasoning about network games
• Efficiency and complexity of price competition among single-product vendors
• Bounds on price of anarchy on linear cost functions
• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
• The buck-passing game
• Dynamic resource allocation games
• Efficiency analysis with respect to the unit cost objectives in scheduling games
• Timed network games
• How good is a two-party election game?
• A comparison of game-theoretic models for parallel trade
• Robust equilibria in location games
• Local verification of global proofs
• Nash social welfare approximation for strategic agents
• Linear-quadratic mean-field-type games: a direct method
• Equilibria of greedy combinatorial auctions
• Scheduling games with rank-based utilities
• Efficiency loss in a Cournot oligopoly with convex market demand
• Selfish bin packing under harmonic mean cost sharing mechanism
• The price of defense
• Coordination mechanisms for scheduling games with machine modification
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Cost-sharing scheduling games on restricted unrelated machines
• On various open-end bin packing game
• Coordinating oligopolistic players in unrelated machine scheduling
• The quality of equilibria for set packing and throughput scheduling games
• The sequential price of anarchy for affine congestion games with few players
• Multi-round cooperative search games with multiple players
• Fair linking mechanisms for resource allocation with correlated player types
• On weak Pareto optimality of nonatomic routing networks
• The power of one evil secret agent
• The anarchy of scheduling without money
• Prices of anarchy of selfish 2D bin packing games
• On Stackelberg strategies in affine congestion games
• Mean-field type games between two players driven by backward stochastic differential equations
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
• A note on the lower bound for the price of anarchy of scheduling games on unrelated machines
• The price of anarchy on uniformly related machines revisited
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Maxmin mechanism in a simple common value auction
• The anarchy of scheduling without money
• Inefficiency of equilibria for the machine covering game on uniform machines
• Distance hedonic games
• Efficient equilibria in polymatrix coordination games
• Decentralized utilitarian mechanisms for scheduling games
• Efficiency loss in a Cournot oligopoly with convex market demand
• Selfish bin coloring
• The impact of social ignorance on weighted congestion games
• A mean-risk model for the traffic assignment problem with stochastic travel times
• On the inefficiency of equilibria in linear bottleneck congestion games
• Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
• On the structure and complexity of worst-case equilibria
• How hard is it to find extreme Nash equilibria in network congestion games?
• Concurrent imitation dynamics in congestion games
• Graphical congestion games
• Transportation network with externalities
• Minimizing expectation plus variance
• Distributed algorithms for QoS load balancing
• Tight bounds for cost-sharing in weighted congestion games
• Efficient methods for selfish network design
• Pairwise cooperations in selfish ring routing for minimax linear latency
• Traffic routing oligopoly
• Cost-sharing scheduling games on restricted unrelated machines
• Traffic assignment: on the interplay between optimization and equilibrium problems
• Decentralized dynamics for finite opinion games
• Selfish bin packing with parameterized punishment
• Mixing time and stationary expected social welfare of logit dynamics
• Congestion games with capacitated resources
• A two-player competitive discrete location model with simultaneous decisions
• The strong price of anarchy of linear bottleneck congestion games
• Robust and scalable middleware for selfish-computer systems
• Bounds on the welfare loss from moral hazard with limited liability
• Inefficiency of equilibria for scheduling game with machine activation costs
• Price of anarchy for parallel link networks with generalized mean objective
• Network-formation games with regular objectives
• Scheduling without payments
• Convergence of best-response dynamics in games with conflicting congestion effects
• Cost-sharing games with rank-based utilities
• Tight bounds for worst-case equilibria
• Game authority for robust and scalable distributed selfish-computer systems
• Contention resolution under selfishness
• Cost-sharing games in real-time scheduling systems
• On the Price of Anarchy of cost-sharing in real-time scheduling systems

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 Q458478)