Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- Sensitivity of wardrop equilibria: revisited
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- The price of anarchy for utilitarian scheduling games on related machines
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Non-atomic one-round walks in congestion games
- Magnitude of inefficiency
- The Price of Stochastic Anarchy
- Local and global price of anarchy of graphical games
- Sharing non-anonymous costs of multiple resources optimally
- On the tree conjecture for the network creation game
- A unified framework for strong price of anarchy in clustering games
- Connectivity and equilibrium in random games
- Topological price of anarchy bounds for clustering games on networks
- A new model for selfish routing
- Designing networks with good equilibria under uncertainty
- Sensitivity of Wardrop Equilibria
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- On the (in)efficiency of MFG equilibria
- Recent studies of agent incentives in internet resource allocation and pricing
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Equilibria for networks with malicious users
- Modelling web-service uncertainty: the angel/daemon approach
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Ranking games
- The Influence of Link Restrictions on (Random) Selfish Routing
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Fragility of the commons under prospect-theoretic risk attitudes
- When Ignorance Helps: Graphical Multicast Cost Sharing Games
- Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
- Selfish versus unselfish optimization of network creation
- Nash equilibrium based fairness
- Mechanism design for set cover games with selfish element agents
- The price of anarchy for polynomial social cost
- A review of transport market modeling using game-theoretic principles
- Congestion games with complementarities
- Price of anarchy for parallel link networks with generalized mean objective
- Bayesian ignorance
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- The Price of Nash Equilibria in Multicast Transmissions Games
- Competitive Cost Sharing with Economies of Scale
- On the price of anarchy of highly congested nonatomic network games
- Computing approximate equilibria in weighted congestion games via best-responses
- Nash equilibria in discrete routing games with convex latency functions
- Sequential scheduling on identical machines
- Linear tolls suffice: new bounds and algorithms for tolls in single source networks
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- On the price of anarchy of two-stage machine scheduling games
- On the robustness of the approximate price of anarchy in generalized congestion games
- Selfish bin covering
- Transportation network with externalities
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- Selfish load balancing for jobs with favorite machines
- Game-theoretic static load balancing for distributed systems
- On Stackelberg strategies in affine congestion games
- Two-terminal routing games with unknown active players
- 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
- Sensitivity of Wardrop equilibria
- 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
- Stackelberg strategies for selfish routing in general multicommodity networks
- The price of anarchy of serial, average and incremental cost sharing
- Nonpreemptive coordination mechanisms for identical machines
- Implementing efficient graphs in connection networks
- Congestion games with linearly independent paths: convergence time and price of anarchy
- Optimization for dynamic ride-sharing: a review
- Load balancing via random local search in closed and open systems
- Design of price mechanisms for network resource allocation via price of anarchy
- Selfish unsplittable flows
- Congestion games with failures
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)
