Worst-case equilibria
From MaRDI portal
Publication:3409969
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Performance of one-round walks in linear congestion games
- On the inefficiency of equilibria in linear bottleneck congestion games
- How much can taxes help selfish routing?
- Computation of equilibria and the price of anarchy in bottleneck congestion games
- Efficient coordination mechanisms for unrelated machine scheduling
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Strategic network formation through peering and service agreements
- Tight bounds for worst-case equilibria
- Two-group knapsack game
- ``Beat-your-rival routing games
- Computational social choice for coordination in agent networks
- Stackelberg thresholds in network routing games or the value of altruism
- Strong equilibrium in cost sharing connection games
- The power of verification for one-parameter agents
- Tight bounds for selfish and greedy load balancing
- Efficiency analysis of load balancing games with and without activation costs
- Strategic decentralization in binary choice composite congestion games
- A geometric approach to the price of anarchy in nonatomic congestion games
- The worst absolute surplus loss in the problem of commons: random priority versus average cost
- Coordination mechanisms for selfish scheduling
- The \(k\)-server problem
- Coarse matching with incomplete information
- Competitive cost sharing with economies of scale
- Network creation games: think global -- act local
- Nash equilibria in stabilizing systems
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
- Parametric packing of selfish items and the subset sum algorithm
- The Price of Anarchy on Uniformly Related Machines Revisited
- Load balancing without regret in the bulletin board model
- Selfish bin packing with cardinality constraints
- Strong price of anarchy
- Algorithm for quadratic semi-assignment problem with partition size coefficients
- Egalitarian-utilitarian bounds in Nash's bargaining problem
- Optimal cost sharing for capacitated facility location games
- A note on a selfish bin packing problem
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- The strong price of anarchy of linear bottleneck congestion games
- Further results on capacitated network design games
- Generalized Nash equilibria for SaaS/PaaS clouds
- The price of anarchy is independent of the network topology
- Bounding the inefficiency of logit-based stochastic user equilibrium
- Price of anarchy for highly congested routing games in parallel networks
- Scheduling games on uniform machines with activation cost
- On the structure of equilibria in basic network formation
- Worst-case equilibria
- 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
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)
