Worst-case equilibria

DOI10.1016/j.cosrev.2009.04.003zbMath1303.91012OpenAlexW2056606651WikidataQ56386815 ScholiaQ56386815MaRDI QIDQ458478

Elias Koutsoupias, Christos H. 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

zbMATH Keywords

Nash eqilibria

Mathematics Subject Classification ID

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

Related Items (only showing first 100 items - show all)

The price of anarchy and stability in general noisy best-response dynamics ⋮ On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games ⋮ Concurrent imitation dynamics in congestion games ⋮ Distance hedonic games ⋮ An abstraction-refinement methodology for reasoning about network games ⋮ On the Uniqueness of Equilibrium in Atomic Splittable Routing Games ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ Selfish bin packing under harmonic mean cost sharing mechanism ⋮ Cost-Sharing Scheduling Games on Restricted Unrelated Machines ⋮ Traffic routing oligopoly ⋮ Robust equilibria in location games ⋮ Unnamed Item ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ The Price of Matching with Metric Preferences ⋮ Decentralized dynamics for finite opinion games ⋮ Efficiency analysis with respect to the unit cost objectives in scheduling games ⋮ On various open-end bin packing game ⋮ A Selective Tour Through Congestion Games ⋮ Linear-quadratic mean-field-type games: a direct method ⋮ Network-formation games with regular objectives ⋮ Mixing time and stationary expected social welfare of logit dynamics ⋮ The price of defense ⋮ Efficiency and complexity of price competition among single-product vendors ⋮ The quality of equilibria for set packing and throughput scheduling games ⋮ Scheduling without payments ⋮ Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy ⋮ On tightness of the Tsaknakis-Spirakis algorithm for approximate Nash equilibrium ⋮ Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis ⋮ Efficient Equilibria in Polymatrix Coordination Games ⋮ Incentive ratio: a game theoretical analysis of market equilibria ⋮ A two-player competitive discrete location model with simultaneous decisions ⋮ Maxmin mechanism in a simple common value auction ⋮ Implementation of optimal schedules in outsourcing with identical suppliers ⋮ Multi-round cooperative search games with multiple players ⋮ The anarchy of scheduling without money ⋮ Efficiency loss in a Cournot oligopoly with convex market demand ⋮ Selfish bin coloring ⋮ Inefficiency of equilibria for scheduling game with machine activation costs ⋮ Coordination mechanisms for scheduling games with proportional deterioration ⋮ Transportation network with externalities ⋮ The price of anarchy on uniformly related machines revisited ⋮ The power of one evil secret agent ⋮ Fair linking mechanisms for resource allocation with correlated player types ⋮ Congestion games with capacitated resources ⋮ Minimizing expectation plus variance ⋮ The strong price of anarchy of linear bottleneck congestion games ⋮ Resource Allocation Games with Multiple Resource Classes ⋮ Graphical congestion games ⋮ The price of anarchy as a classifier for mechanism design in a Pareto-Bayesian-Nash context ⋮ Efficient methods for selfish network design ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Mean-field type games between two players driven by backward stochastic differential equations ⋮ Non-clairvoyant scheduling games ⋮ On understanding price-QoS war for competitive market and confused consumers ⋮ Robust and scalable middleware for selfish-computer systems ⋮ Incentive-compatible interdomain routing ⋮ Distributed algorithms for QoS load balancing ⋮ Convergence of best-response dynamics in games with conflicting congestion effects ⋮ Contention resolution under selfishness ⋮ Minimizing Rosenthal potential in multicast games ⋮ Hierarchical Network Formation Games ⋮ The complexity of pure equilibria in mix-weighted congestion games on parallel links ⋮ Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research ⋮ Network characterizations for excluding Braess's paradox ⋮ A coordination mechanism for a scheduling game with parallel-batching machines ⋮ The price of optimum: complexity and approximation for a matching game ⋮ Improving the price of anarchy for selfish routing via coordination mechanisms ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs ⋮ Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem ⋮ The impact of social ignorance on weighted congestion games ⋮ Game authority for robust and scalable distributed selfish-computer systems ⋮ Window-games between TCP flows ⋮ Inefficiency of equilibria for the machine covering game on uniform machines ⋮ How good is a two-party election game? ⋮ Dynamic resource allocation games ⋮ Coordinating oligopolistic players in unrelated machine scheduling ⋮ Selfish bin packing with parameterized punishment ⋮ Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 ⋮ Decentralized utilitarian mechanisms for scheduling games ⋮ Selfish routing in public services ⋮ A Comparison of Game-Theoretic Models for Parallel Trade ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Dynamic Resource Allocation Games ⋮ The Anarchy of Scheduling Without Money ⋮ How hard is it to find extreme Nash equilibria in network congestion games? ⋮ On Stackelberg strategies in affine congestion games ⋮ Efficiency Loss in a Cournot Oligopoly with Convex Market Demand ⋮ The Pareto frontier of inefficiency in mechanism design ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems ⋮ On weak Pareto optimality of nonatomic routing networks ⋮ Computing (and Life) Is All about Tradeoffs ⋮ Defense coordination in security games: equilibrium analysis and mechanism design ⋮ A note on the lower bound for the price of anarchy of scheduling games on unrelated machines ⋮ Bounds on price of anarchy on linear cost functions ⋮ Non-blind strategies in timed network congestion games ⋮ Timed network games ⋮ A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times ⋮ Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines ⋮ Performance guarantees of local search for minsum scheduling problems

Cites Work

This page was built for publication: Worst-case equilibria