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 price of anarchy on uniformly related machines revisited
- Nash equilibria with minimum potential in undirected broadcast games
- Approximation algorithms for a bi-level knapsack problem
- Reducing price of anarchy of selfish task allocation with more selfishness
- Stackelberg strategies for atomic congestion games
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Pricing with markups in industries with increasing marginal costs
- Improved lower bounds on the price of stability of undirected network design games
- When ignorance helps: graphical multicast cost sharing games
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- An improved mechanism for selfish bin packing
- The structure and complexity of Nash equilibria for a selfish routing game
- Utilitarian resource assignment
- Coordination mechanisms
- On the efficiency of price competition
- Competitive profit maximization in social networks
- Selfish bin coloring
- On truthfulness and approximation for scheduling selfish tasks
- Equilibrium and inefficiency in multi-product Cournot games
- Price and capacity competition
- Generalized graph \(k\)-coloring games
- Service rate control of closed Jackson networks from game theoretic perspective
- On the structure and complexity of worst-case equilibria
- On spectrum sharing games
- Worst-case Nash equilibria in restricted routing
- Profit loss in differentiated oligopolies
- The effect of supplier capacity on the supply chain profit
- The complexity of welfare maximization in congestion games
- On the efficiency of the proportional allocation mechanism for divisible resources
- On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis
- Capacity allocation to sales agents in a decentralized logistics network
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Walrasian pricing in multi-unit auctions
- Selfish splittable flows and NP-completeness
- Improved lower bounds on the price of stability of undirected network design games
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- Equilibria in routing games with edge priorities
- Selfish routing with incomplete information
- Local smoothness and the price of anarchy in splittable congestion games
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Congestion games with capacitated resources
- Computing Nash equilibria for scheduling on restricted parallel links
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- The price of atomic selfish ring routing
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Selfishness need not be bad
- Tradeoffs in worst-case equilibria
- Robust and scalable middleware for selfish-computer systems
- Selfish square packing
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)
