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)
- 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
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- The ring design game with fair cost allocation
- Game authority for robust and scalable distributed selfish-computer systems
- Selfish Bin Packing
- Approximate Strong Equilibrium in Job Scheduling Games
- LP-based covering games with low price of anarchy
- Price of anarchy for graph coloring games with concave payoff
- Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
- Stability vs. optimality in selfish ring routing
- Profit sharing with thresholds and non-monotone player utilities
- Welfare guarantees for proportional allocations
- Network movement games
- On the performances of Nash equilibria in isolation games
- Structure and complexity of extreme Nash equilibria
- The Price of Anarchy of a Network Creation Game with Exponential Payoff
- The price of anarchy in bilateral network formation in an adversary model
- Social context congestion games
- On the hardness of network design for bottleneck routing games
- Maximizing the minimum load: the cost of selfishness
- 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
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)
