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
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- Malicious Bayesian Congestion Games
- Location Games on Networks: Existence and Efficiency of Equilibria
- Designing cost-sharing methods for Bayesian games
- Designing cost-sharing methods for Bayesian games
- Welfare guarantees in Schelling segregation
- The price of imperfect competition for a spanning network
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Simple combinatorial auctions with budget constraints
- Price of anarchy for mean field games
- Informational Braess' paradox: the effect of information on traffic congestion
- Decentralized beneficiary behavior in humanitarian supply chains: models, performance bounds, and coordination mechanisms
- On the price of anarchy for flows over time
- FIFO and randomized competitive packet routing games
- Quality of strong equilibria for selfish bin packing with uniform cost sharing
- Wary of the worst: maximizing award guarantees when new claimants may arrive
- Value of information in Bayesian routing games
- Tighter price of anarchy for selfish task allocation on selfish machines
- Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model
- Equilibrium strategies for multiple interdictors on a common network
- Delegation and ambiguity in correlated equilibrium
- Modified Schelling games
- On the robustness of the approximate price of anarchy in generalized congestion games
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing
- From packing rules to cost-sharing mechanisms
- On the tree conjecture for the network creation game
- Selfish vector packing
- Price of Pareto optimality in hedonic games
- On the sequential price of anarchy of isolation games
- Prices of anarchy of selfish 2D bin packing games
- Selfish vector packing
- Quality of equilibria for selfish bin packing with cost sharing variants
- A game-theoretic perspective of deep neural networks
- On the impact of singleton strategies in congestion games
- Rare Nash equilibria and the price of anarchy in large static games
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
- Robust market equilibria under uncertain cost
- Deterministic and stochastic wireless network games: equilibrium, dynamics, and price of anarchy
- Equilibria in online games
- Equilibria in online games
- On Pareto optimality in social distance games
- A note on the efficiency of position mechanisms with budget constraints
- Mean-field type games between two players driven by backward stochastic differential equations
- Wealth Inequality and the Price of Anarchy
- Greedy distributed optimization of multi-commodity flows
- An incentive mechanism for selfish bin covering
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Topological Influence and Locality in Swap Schelling 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)
