Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- The price of anarchy is independent of the network topology
- Price of anarchy for mean field games
- 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
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- Modelling web-service uncertainty: the angel/daemon approach
- Facets of the fully mixed Nash equilibrium conjecture
- Network sharing by two mobile operators: beyond competition, cooperation
- Malicious Bayesian Congestion Games
- Strategic network formation through an intermediary
- Nash equilibrium based fairness
- The uniqueness property for networks with several origin-destination pairs
- A new lower bound on the price of anarchy of selfish bin packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- A review of transport market modeling using game-theoretic principles
- On Pareto optimality in social distance games
- On the tree conjecture for the network creation game
- Stackelberg strategies for atomic congestion games
- On the price of anarchy of two-stage machine scheduling games
- Fighting for routes: resource allocation among competing planners in transportation networks
- Nash equilibria in two-resource congestion games with player-specific payoff functions
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Pricing with markups in industries with increasing marginal costs
- Load balancing via random local search in closed and open systems
- Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Parametric packing of selfish items and the subset sum algorithm
- Egalitarian-utilitarian bounds in Nash's bargaining problem
- Extending the notion of rationality of selfish agents: second order Nash equilibria
- When ignorance helps: graphical multicast cost sharing games
- Improved lower bounds on the price of stability of undirected network design games
- A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- The Influence of Link Restrictions on (Random) Selfish Routing
- Geometric spanner games
- Pareto efficiency and approximate Pareto efficiency in routing and load balancing games
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- Selfish bin packing with cardinality constraints
- A game-theoretic perspective of deep neural networks
- The price of anarchy in loss systems
- The structure and complexity of Nash equilibria for a selfish routing game
- Toss one's cake, and eat it too: partial divisions can improve social welfare in cake cutting
- Strictly periodic scheduling in IMA-based architectures
- Utilitarian resource assignment
- Selfish load balancing for jobs with favorite machines
- Coordination mechanisms
- On the efficiency of price competition
- Designing cost-sharing methods for Bayesian games
- Selfish bin coloring
- Magnitude of inefficiency
- Improved price of anarchy for machine scheduling games with coordination mechanisms
- Equilibria for networks with malicious users
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- The Price of Nash Equilibria in Multicast Transmissions Games
- Designing cost-sharing methods for Bayesian games
- An improved mechanism for selfish bin packing
- How to find Nash equilibria with extreme total latency in network congestion games?
- Competitive profit maximization in social networks
- Game of banks -- biform game theoretical framework for ATM network cost sharing
- Selfish bin packing
- 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
- Multiple access game with imperfect information
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Geometric Network Creation Games
- The price of anarchy for utilitarian scheduling games on related machines
- Competitive Cost Sharing with Economies of Scale
- On truthfulness and approximation for scheduling selfish tasks
- Optimal coordination mechanisms for unrelated machine scheduling
- Nash equilibria in discrete routing games with convex latency functions
- Some anomalies of farsighted strategic behavior
- Approximate strong equilibria in job scheduling games with two uniformly related machines
- On the impact of singleton strategies in congestion games
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Simple combinatorial auctions with budget constraints
- Toll caps in privatized road networks
- Price and capacity competition
- Equilibrium and inefficiency in multi-product Cournot games
- Price of Pareto optimality in hedonic games
- On tree equilibria in max-distance network creation games
- Human migration networks and policy interventions: bringing population distributions in line with system optimization
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- Non-monotonically rewarded job scheduling
- On the inefficiency of equilibria in linear bottleneck congestion games
- Connectivity and equilibrium in random games
- Network QoS games: stability vs optimality tradeoff
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
- Common-knowledge and Bayesian equilibrium in network game
- On the structure and complexity of worst-case equilibria
- Generalized graph \(k\)-coloring games
- Service rate control of closed Jackson networks from game theoretic perspective
- Strong price of anarchy
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)
