The following pages link to Worst-case equilibria (Q458478):
Displayed 50 items.
- Selfish routing in public services (Q146294) (← links)
- Concurrent imitation dynamics in congestion games (Q287990) (← links)
- Traffic routing oligopoly (Q302120) (← links)
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- Decentralized dynamics for finite opinion games (Q313975) (← links)
- Network-formation games with regular objectives (Q342715) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
- Maxmin mechanism in a simple common value auction (Q397961) (← links)
- Efficiency loss in a Cournot oligopoly with convex market demand (Q406255) (← links)
- Selfish bin coloring (Q411255) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Contention resolution under selfishness (Q487024) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- A two-player competitive discrete location model with simultaneous decisions (Q613464) (← links)
- Graphical congestion games (Q639291) (← links)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Incentive-compatible interdomain routing (Q658663) (← links)
- Distributed algorithms for QoS load balancing (Q658665) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- On the Price of Anarchy of cost-sharing in real-time scheduling systems (Q777962) (← links)
- Distance hedonic games (Q831802) (← links)
- Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
- Congestion games with capacitated resources (Q904685) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- Window-games between TCP flows (Q982652) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- The price of anarchy and stability in general noisy best-response dynamics (Q1621728) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Efficiency analysis with respect to the unit cost objectives in scheduling games (Q1645201) (← links)
- Linear-quadratic mean-field-type games: a direct method (Q1651872) (← links)
- Scheduling without payments (Q1678760) (← links)
- Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
- Fair linking mechanisms for resource allocation with correlated player types (Q1698330) (← links)
- Mean-field type games between two players driven by backward stochastic differential equations (Q1712157) (← links)
- Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research (Q1982858) (← links)
- Traffic assignment: methods and simulations for an alternative formulation of the fixed demand problem (Q1997319) (← links)