Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- A coordination mechanism for a scheduling game with uniform-batching machines
- The price of anarchy of affine congestion games with similar strategies
- A multiple access game with incomplete information
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- Decentralized subcontractor scheduling with divisible jobs
- Tight inefficiency bounds for perception-parameterized affine congestion games
- Resilience of routing in parallel link networks
- Cost sharing mechanisms for fair pricing of resource usage
- The intermediate price of anarchy (IPoA) in bin packing games
- Scheduling to Maximize Participation
- Facets of the fully mixed Nash equilibrium conjecture
- Capacitated network design games
- Inefficiency of games with social context
- Schelling games on graphs
- Achieving target equilibria in network routing games without knowing the latency functions
- Linear-quadratic mean-field-type games: a direct method
- On cost sharing in the provision of a binary and excludable public good
- Evaluating the effect of sub-optimality
- Toll caps in privatized road networks
- Multistage interval scheduling games
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Collusion in atomic splittable routing games
- A new lower bound on the price of anarchy of selfish bin packing
- Online learning of Nash equilibria in congestion games
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Performance of non-cooperative routing over parallel non-observable queues
- Agent incentives of a proportional sharing mechanism in resource sharing
- Competitive contagion in networks
- How to find Nash equilibria with extreme total latency in network congestion games?
- Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions
- Facets of the Fully Mixed Nash Equilibrium Conjecture
- Distributed Learning of Wardrop Equilibria
- Altruistic Hedonic Games
- The buck-passing game
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- 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
- Cost sharing in production economies
- The price of stability of weighted congestion games
- The price of stability of weighted congestion games
- Using weight decision for decreasing the price of anarchy in selfish bin packing games
- Risk-based models for emergency shelter and exit design in buildings
- The curse of sequentiality in routing games
- Equilibrium computation of the Hart and Mas-Colell bargaining model
- On network formation games with heterogeneous players and basic network creation games
- A network pricing game for selfish traffic
- On network formation games with heterogeneous players and basic network creation games
- Price of anarchy in parallel processing
- 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
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)
