Worst-case equilibria
From MaRDI portal
Publication:3409969
zbMATH Open1099.91501MaRDI QIDQ3409969FDOQ3409969
Authors: Elias Koutsoupias, Christos Papadimitriou 
Publication date: 21 November 2006
Recommendations
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)
- Facets of the fully mixed Nash equilibrium conjecture
- A new lower bound on the price of anarchy of selfish bin packing
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- How to find Nash equilibria with extreme total latency in network congestion games?
- Toll caps in privatized road networks
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Performance of non-cooperative routing over parallel non-observable queues
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Tight inefficiency bounds for perception-parameterized affine congestion games
- Achieving target equilibria in network routing games without knowing the latency functions
- The curse of sequentiality in routing games
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Agent incentives of a proportional sharing mechanism in resource sharing
- The buck-passing game
- Risk-based models for emergency shelter and exit design in buildings
- A coordination mechanism for a scheduling game with uniform-batching machines
- Bounding the inefficiency of compromise in opinion formation
- Scheduling to Maximize Participation
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Strongly polynomial-time truthful mechanisms in one shot
- Linear-quadratic mean-field-type games: a direct method
- Collusion in atomic splittable routing games
- Online learning of Nash equilibria in congestion games
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- Decentralized subcontractor scheduling with divisible jobs
- On cost sharing in the provision of a binary and excludable public good
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- Capacitated network design games
- Inefficiency of games with social context
- Cost sharing in production economies
- A network pricing game for selfish traffic
- Price of anarchy in parallel processing
- Multistage interval scheduling games
- Competitive contagion in networks
- Distributed Learning of Wardrop Equilibria
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- Schelling games on graphs
- Evaluating the effect of sub-optimality
- Altruistic Hedonic Games
- Scheduling to maximize participation
- On network formation games with heterogeneous players and basic network creation games
- The intermediate price of anarchy (IPoA) in bin packing games
- Facets of the Fully Mixed Nash Equilibrium Conjecture
- The price of anarchy of affine congestion games with similar strategies
- Cost sharing mechanisms for fair pricing of resource usage
- Equilibrium computation of the Hart and Mas-Colell bargaining model
- A multiple access game with incomplete information
- Resilience of routing in parallel link networks
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- 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
- 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
- On network formation games with heterogeneous players and basic network creation games
- Heterogeneity and chaos in congestion games
- Robust market equilibria under uncertain cost
- Greedy distributed optimization of multi-commodity flows
- Anarchy is free in network creation
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- FIFO and randomized competitive packet routing games
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)
