Pages that link to "Item:Q2560099"
From MaRDI portal
The following pages link to A class of games possessing pure-strategy Nash equilibria (Q2560099):
Displayed 50 items.
- Weak equilibrium in a spatial model (Q637573) (← links)
- Graphical congestion games (Q639291) (← links)
- Congestion games with failures (Q642974) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Performance of one-round walks in linear congestion games (Q647486) (← links)
- Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
- Strategic complementarities and nested potential games (Q660102) (← links)
- On best response dynamics in weighted congestion games with polynomial delays (Q661067) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Best response equivalence (Q705868) (← links)
- Competitive routing over time (Q719282) (← links)
- Network design with weighted players (Q733733) (← links)
- Fragility of the commons under prospect-theoretic risk attitudes (Q738933) (← links)
- Regular quantal response equilibrium (Q812034) (← links)
- Congestion games with malicious players (Q834852) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Congestion games with load-dependent failures: Identical resources (Q834859) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Coordination mechanisms (Q838145) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- When ignorance helps: graphical multicast cost sharing games (Q844895) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Pigouvian pricing and stochastic evolutionary implementation (Q869870) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Capacitated network design games (Q904684) (← 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)
- Externality effects in the formation of societies (Q908184) (← links)
- Dynamic club formation with coordination (Q908188) (← links)
- Discounted and finitely repeated minority games with public signals (Q931784) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- How to find Nash equilibria with extreme total latency in network congestion games? (Q966426) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Window-games between TCP flows (Q982652) (← links)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- Club networks with multiple memberships and noncooperative stability (Q993780) (← links)
- A payoff-based learning procedure and its application to traffic games (Q993787) (← links)
- Brown's original fictitious play (Q996398) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)