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)

• 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
• Simple combinatorial auctions with budget constraints
• Price of Pareto optimality in hedonic games
• Atomic congestion games with random players: network equilibrium and the price of anarchy
• Network QoS games: stability vs optimality tradeoff
• The price of stability for undirected broadcast network design with fair cost allocation is constant
• Location Games on Networks: Existence and Efficiency of Equilibria
• Topological Influence and Locality in Swap Schelling Games.
• On the efficiency of all-pay mechanisms
• Price of anarchy in a linear-state stochastic dynamic game
• Colocating tasks in data centers using a side-effects performance model
• Tighter price of anarchy for selfish task allocation on selfish machines
• Rare Nash equilibria and the price of anarchy in large static games
• Deterministic and stochastic wireless network games: equilibrium, dynamics, and price of anarchy
• Modified Schelling games
• Equilibrium strategies for multiple interdictors on a common network
• Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
• Dynamic Atomic Congestion Games with Seasonal Flows
• On the sequential price of anarchy of isolation games
• Selfish bin packing under harmonic mean cost sharing mechanism
• Delegation and ambiguity in correlated equilibrium
• Welfare guarantees in Schelling segregation
• Wealth Inequality and the Price of Anarchy
• The price of imperfect competition for a spanning network
• An incentive mechanism for selfish bin covering
• Informational Braess' paradox: the effect of information on traffic congestion
• Value of information in Bayesian routing games
• On the robustness of the approximate price of anarchy in generalized congestion games
• From packing rules to cost-sharing mechanisms
• Equilibria in online games
• Equilibria in online games
• Heterogeneity and chaos in congestion games
• On the price of anarchy for flows over time
• Robust market equilibria under uncertain cost
• Greedy distributed optimization of multi-commodity flows
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
• FIFO and randomized competitive packet routing games
• Prices of anarchy of selfish 2D bin packing games
• A note on the efficiency of position mechanisms with budget constraints
• Mean-field type games between two players driven by backward stochastic differential equations
• Wary of the worst: maximizing award guarantees when new claimants may arrive
• Selfish vector packing
• Selfish vector packing
• Price of anarchy for mean field games
• Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
• 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

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)