Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- Stackelberg strategies for atomic congestion games
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Robust and scalable middleware for selfish-computer systems
- On spectrum sharing games
- Walrasian pricing in multi-unit auctions
- The price of anarchy on uniformly related machines revisited
- LP-based covering games with low price of anarchy
- Utilitarian resource assignment
- 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
- Worst-case Nash equilibria in restricted routing
- Equilibria in routing games with edge priorities
- The price of atomic selfish ring routing
- Coordination mechanisms
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Selfish square packing
- On the efficiency of local electricity markets under decentralized and centralized designs: a multi-leader Stackelberg game analysis
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- On the efficiency of price competition
- The Price of Anarchy of a Network Creation Game with Exponential Payoff
- Equilibrium and inefficiency in multi-product Cournot games
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Selfish bin coloring
- Competitive profit maximization in social networks
- Profit loss in differentiated oligopolies
- On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
- Pricing with markups in industries with increasing marginal costs
- Tradeoffs in worst-case equilibria
- Selfish routing with incomplete information
- Improved lower bounds on the price of stability of undirected network design games
- Service rate control of closed Jackson networks from game theoretic perspective
- Selfishness need not be bad
- Social context congestion games
- On truthfulness and approximation for scheduling selfish tasks
- Price and capacity competition
- Game authority for robust and scalable distributed selfish-computer systems
- Selfish splittable flows and NP-completeness
- Congestion games with capacitated resources
- Capacity allocation to sales agents in a decentralized logistics network
- Selfish Bin Packing
- An improved mechanism for selfish bin packing
- Local smoothness and the price of anarchy in splittable congestion games
- Approximate Strong Equilibrium in Job Scheduling Games
- On the structure and complexity of worst-case equilibria
- The price of anarchy in bilateral network formation in an adversary model
- On the efficiency of the proportional allocation mechanism for divisible resources
- When ignorance helps: graphical multicast cost sharing games
- Stability vs. optimality in selfish ring routing
- Price of anarchy for graph coloring games with concave payoff
- On the performances of Nash equilibria in isolation games
- 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
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Improved lower bounds on the price of stability of undirected network design games
- On the hardness of network design for bottleneck routing games
- Profit sharing with thresholds and non-monotone player utilities
- Welfare guarantees for proportional allocations
- Generalized graph \(k\)-coloring games
- The complexity of welfare maximization in congestion games
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- Network movement games
- Maximizing the minimum load: the cost of selfishness
- Structure and complexity of extreme Nash equilibria
- The structure and complexity of Nash equilibria for a selfish routing game
- Computing Nash equilibria for scheduling on restricted parallel links
- The ring design game with fair cost allocation
- Some results of Christos Papadimitriou on internet structure, network routing, and web information
- The effect of supplier capacity on the supply chain profit
- Selfish bin packing
- On the performance of approximate equilibria in congestion games
- Designing fast converging cost sharing methods for multicast transmissions
- A survey on networking games in telecommunications
- Network design with weighted players
- Almost budget-balanced VCG mechanisms to assign multiple objects
- Atomic congestion games: fast, myopic and concurrent
- Worst-case analysis of non-cooperative load balancing
- On a generalized Cournot oligopolistic competition game
- Strictly periodic scheduling in IMA-based architectures
- Strong equilibria in games with the lexicographical improvement property
- Optimal coordination mechanisms for unrelated machine scheduling
- 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
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Bottleneck congestion games with logarithmic price of anarchy
- Non-cooperative facility location and covering games
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Selfish routing in public services
- Collusion in atomic splittable routing games
- Stackelberg strategies and collusion in network games with splittable flow
- The uniqueness property for networks with several origin-destination pairs
- On the performance of mildly greedy players in cut games
- Atomic routing games on maximum congestion
- Bounding the inefficiency of equilibria in nonatomic congestion games
- An efficient and almost budget balanced cost sharing method
- Non-cooperative tree creation
- Efficient graph topologies in network routing games
- Some anomalies of farsighted strategic behavior
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)
