Worst-case equilibria
From MaRDI portal
Publication:458478
DOI10.1016/J.COSREV.2009.04.003zbMATH Open1303.91012OpenAlexW2056606651WikidataQ56386815 ScholiaQ56386815MaRDI QIDQ458478FDOQ458478
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
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)
- Title not available (Why is that?)
- 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)
- The price of anarchy on uniformly related machines revisited
- A Selective Tour Through Congestion Games
- 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
- 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
- Hierarchical Network Formation Games
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem
- On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
- 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
- Efficient Equilibria in Polymatrix Coordination Games
- Distributed algorithms for QoS load balancing
- 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
- On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
- 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
- Tight Bounds for Cost-Sharing in Weighted Congestion Games
- Minimizing Rosenthal potential in multicast games
- The complexity of pure equilibria in mix-weighted congestion games on parallel links
- Introduction to the inefficiency of equilibria
- Selfish routing in public services
- Incentive-compatible interdomain routing
- Network characterizations for excluding Braess's paradox
- A coordination mechanism for a scheduling game with parallel-batching machines
- Non-clairvoyant scheduling games
- The Pareto frontier of inefficiency in mechanism design
- Dynamic resource allocation games
- Defense coordination in security games: equilibrium analysis and mechanism design
- Worst-case equilibria
- The price of optimum: complexity and approximation for a matching game
- Coordination mechanisms for scheduling games with proportional deterioration
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- 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?)
- A Comparison of Game-Theoretic Models for Parallel Trade
- Nash Social Welfare Approximation for Strategic Agents
- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Title not available (Why is that?)
- On understanding price-QoS war for competitive market and confused consumers
- The Buck-Passing Game
- Efficiency Loss in a Cournot Oligopoly with Convex Market Demand
- Implementation of optimal schedules in outsourcing with identical suppliers
- Non-blind strategies in timed network congestion games
- Timed network games
- Performance guarantees of local search for minsum scheduling problems
- Tight welfare guarantees for pure Nash equilibria of the uniform price auction
- 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
- Equilibria of Greedy Combinatorial Auctions
- 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
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines
- Efficiency analysis with respect to the unit cost objectives in scheduling games
- How good is a two-party election game?
- Robust equilibria in location games
- Linear-quadratic mean-field-type games: a direct method
- Dynamic Resource Allocation Games
- Scheduling games with rank-based utilities
- Selfish bin packing under harmonic mean cost sharing mechanism
- The price of defense
- Coordination mechanisms for scheduling games with machine modification
- Prices of Anarchy of Selfish 2D Bin Packing Games
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
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)
