Worst-case equilibria
From MaRDI portal
(Redirected from Publication:3409969)
Worst-case equilibria (scientific article; zbMATH DE number 5074385)
Worst-case equilibria (scientific article; zbMATH DE number 5074385)
Recommendations
Cited in
(only showing first 100 items - show all)- Almost budget-balanced VCG mechanisms to assign multiple objects
- Profit loss in differentiated oligopolies
- The power of verification for one-parameter agents
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- Strong price of anarchy
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox
- Coordination mechanisms for selfish scheduling
- Strongly polynomial-time truthful mechanisms in one shot
- Edge pricing of multicommodity networks for selfish users with elastic demands
- Non-cooperative tree creation
- Stackelberg strategies for selfish routing in general multicommodity networks
- Price and capacity competition
- Efficient graph topologies in network routing games
- Bounding the inefficiency of logit-based stochastic user equilibrium
- Mechanism design for set cover games with selfish element agents
- On truthfulness and approximation for scheduling selfish tasks
- Two-terminal routing games with unknown active players
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
- Selfish routing in public services
- A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis
- Tight inefficiency bounds for perception-parameterized affine congestion games
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- Risk-based models for emergency shelter and exit design in buildings
- Linear-quadratic mean-field-type games: a direct method
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- On network formation games with heterogeneous players and basic network creation 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
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare
- Recent studies of agent incentives in internet resource allocation and pricing
- Non-atomic one-round walks in congestion games
- Designing cost-sharing methods for Bayesian games
- Price of anarchy for highly congested routing games in parallel networks
- Toll caps in privatized road networks
- Competitive contagion in networks
- The intermediate price of anarchy (IPoA) in bin packing games
- On the efficiency of all-pay mechanisms
- Price of anarchy in a linear-state stochastic dynamic game
- Colocating tasks in data centers using a side-effects performance model
- Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games
- Evaluating the effect of sub-optimality
- Sequential scheduling on identical machines
- Network QoS games: stability vs optimality tradeoff
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Nash equilibrium based fairness
- A network pricing game for selfish traffic
- Entry, competition, and regulation in cognitive radio scenarios: a simple game theory model
- Designing fast converging cost sharing methods for multicast transmissions
- Selfish vector packing
- On the tree conjecture for the network creation game
- Matching supply and demand in a sharing economy: classification, computational complexity, and application
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery
- Simple combinatorial auctions with budget constraints
- Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Equilibrium strategies for multiple interdictors on a common network
- Magnitude of inefficiency
- A review of transport market modeling using game-theoretic principles
- Price of Pareto optimality in hedonic games
- On the price of anarchy of two-stage machine scheduling games
- Schelling games on graphs
- Bounding the inefficiency of compromise in opinion formation
- On the robustness of the approximate price of anarchy in generalized congestion games
- Delegation and ambiguity in correlated equilibrium
- From packing rules to cost-sharing mechanisms
- Tighter price of anarchy for selfish task allocation on selfish machines
- Atomic congestion games with random players: network equilibrium and the price of anarchy
- FIFO and randomized competitive packet routing games
- On Pareto optimality in social distance games
- A multiple access game with incomplete information
- Machine load balancing game with linear externalities
- A game-theoretic perspective of deep neural networks
- A game theoretic model of the behavioural gaming that takes place at the EMS-ED interface
- Selfish bin packing under harmonic mean cost sharing mechanism
- The limit of targeting in networks
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem
- The Price of Anarchy of generic valid utility systems
- Beyond Pigouvian taxes: a worst case analysis
- Travel times, rational queueing and the macroscopic fundamental diagram of traffic flow
- Recent studies of agent incentives in Internet resource allocation and pricing
- Optimal externalities in a parallel transportation network
- Interconnected pay-as-bid auctions
- Sensitivity of wardrop equilibria: revisited
- Equilibrium and inefficiency in multi-product Cournot games
- Equilibria in routing games with edge priorities
- Transportation network with externalities
- The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
- Smart routing of electric vehicles for load balancing in smart grids
- The price of stability for undirected broadcast network design with fair cost allocation is constant
- Quality of equilibria for selfish bin packing with cost sharing variants
- Computation and efficiency of potential function minimizers of combinatorial congestion games
- Optimization for dynamic ride-sharing: a review
- Local smoothness and the price of anarchy in splittable congestion games
- On cost sharing in the provision of a binary and excludable public good
- The effect of supplier capacity on the supply chain profit
- Auctioning or assigning an object: some remarkable VCG mechanisms
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation
- Two-group knapsack game
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)
