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)

• The uniqueness property for networks with several origin-destination pairs
• Load balancing via random local search in closed and open systems
• Parametric packing of selfish items and the subset sum algorithm
• Egalitarian-utilitarian bounds in Nash's bargaining problem
• Selfish bin packing with cardinality constraints
• Strictly periodic scheduling in IMA-based architectures
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Selfish bin packing
• Optimal coordination mechanisms for unrelated machine scheduling
• Some anomalies of farsighted strategic behavior
• On the inefficiency of equilibria in linear bottleneck congestion games
• Inoculation strategies for victims of viruses and the sum-of-squares partition problem
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Strong price of anarchy
• Two-group knapsack game
• Efficient coordination mechanisms for unrelated machine scheduling
• Worst-case analysis of non-cooperative load balancing
• Optimal cost sharing for capacitated facility location games
• Generalized Nash equilibria for SaaS/PaaS clouds
• Tight bounds for selfish and greedy load balancing
• Load balancing without regret in the bulletin board model
• Almost budget-balanced VCG mechanisms to assign multiple objects
• The price of anarchy in an exponential multi-server
• Strong stability of Nash equilibria in load balancing games
• The toll effect on price of anarchy when costs are nonlinear and asymmetric
• An efficient and almost budget balanced cost sharing method
• How much can taxes help selfish routing?
• Computation of equilibria and the price of anarchy in bottleneck congestion games
• A geometric approach to the price of anarchy in nonatomic congestion games
• Competitive cost sharing with economies of scale
• A survey on networking games in telecommunications
• Design of price mechanisms for network resource allocation via price of anarchy
• ``Beat-your-rival routing games
• The \(k\)-server problem
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• The Price of Anarchy on Uniformly Related Machines Revisited
• Network design with weighted players
• Atomic congestion games: fast, myopic and concurrent
• Computational social choice for coordination in agent networks
• Stackelberg thresholds in network routing games or the value of altruism
• Strong equilibrium in cost sharing connection games
• On the performance of approximate equilibria in congestion games
• The price of anarchy of serial, average and incremental cost sharing
• The power of verification for one-parameter agents
• Coordination mechanisms for selfish scheduling
• Bounding the inefficiency of logit-based stochastic user equilibrium
• Atomic routing games on maximum congestion
• Strategic decentralization in binary choice composite congestion games
• Inefficiency analysis of the scheduling game on limited identical machines with activation costs
• The strong price of anarchy of linear bottleneck congestion games
• Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
• Efficient graph topologies in network routing games
• Stackelberg strategies for selfish routing in general multicommodity networks
• Congestion games with linearly independent paths: convergence time and price of anarchy
• On the severity of Braess's paradox: designing networks for selfish users is hard
• A note on a selfish bin packing problem
• Stackelberg strategies and collusion in network games with splittable flow
• Non-cooperative facility location and covering games
• Non-cooperative tree creation
• Selfish unsplittable flows
• Tight bounds for worst-case equilibria
• Strategic network formation through peering and service agreements
• Price of anarchy for highly congested routing games in parallel networks
• Designing fast converging cost sharing methods for multicast transmissions
• Bottleneck congestion games with logarithmic price of anarchy
• On the performance of mildly greedy players in cut games
• The worst absolute surplus loss in the problem of commons: random priority versus average cost
• On a generalized Cournot oligopolistic competition game
• Optimization for dynamic ride-sharing: a review
• Congestion games with failures
• Performance of one-round walks in linear congestion games
• Network creation games: think global -- act local
• Further results on capacitated network design games
• Coarse matching with incomplete information
• Nonpreemptive coordination mechanisms for identical machines
• Scheduling games on uniform machines with activation cost
• Strong equilibria in games with the lexicographical improvement property
• Selfish routing in public services
• Efficiency analysis of load balancing games with and without activation costs
• Implementing efficient graphs in connection networks
• On the structure of equilibria in basic network formation
• Worst-case equilibria
• Nash equilibria in stabilizing systems
• The price of anarchy is independent of the network topology
• Collusion in atomic splittable routing games
• Algorithm for quadratic semi-assignment problem with partition size coefficients
• Malicious Bayesian Congestion Games
• On the tree conjecture for the network creation game
• Quality of equilibria for selfish bin packing with cost sharing variants
• On Pareto optimality in social distance games
• Quality of strong equilibria for selfish bin packing with uniform cost sharing
• Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model
• Pareto optimal equilibria for selfish bin packing with uniform cost sharing
• A game-theoretic perspective of deep neural networks
• Designing cost-sharing methods for Bayesian games
• Designing cost-sharing methods for Bayesian games
• Matching supply and demand in a sharing economy: classification, computational complexity, and application
• On the impact of singleton strategies in congestion games
• Human migration networks and policy interventions: bringing population distributions in line with system optimization
• Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery

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)