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
- 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
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)
