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)
- 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
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Ranking games
- When Ignorance Helps: Graphical Multicast Cost Sharing Games
- The price of anarchy for polynomial social cost
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Selfish bin covering
- A new model for selfish routing
- Sensitivity of wardrop equilibria: revisited
- Sharing non-anonymous costs of multiple resources optimally
- A unified framework for strong price of anarchy in clustering games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- On the tree conjecture for the network creation game
- Designing networks with good equilibria under uncertainty
- Recent studies of agent incentives in internet resource allocation and pricing
- Computing approximate equilibria in weighted congestion games via best-responses
- Sequential scheduling on identical machines
- Non-atomic one-round walks in congestion games
- 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
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)
