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.
- Best response equivalence (Q705868) (← links)
- Network design with weighted players (Q733733) (← 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)
- 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)
- Brown's original fictitious play (Q996398) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Distributed consensus in noncooperative inventory games (Q1011231) (← links)
- Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- Strategic basins of attraction, the path dominance core, and network formation games (Q1021609) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Weighted congestion games with separable preferences (Q1036603) (← links)
- Two-terminal routing games with unknown active players (Q1045998) (← links)
- Equilibrium in a finite local public goods economy (Q1270060) (← links)
- Potentials in cooperative TU-games (Q1277478) (← links)
- Correlated equilibrium and potential games (Q1358635) (← links)
- Strong equilibrium in congestion games (Q1378018) (← links)
- Pure strategy Nash equilibrium in a group formation game with positive externalities (Q1378022) (← links)
- Equilibria and approximate equilibria in infinite potential games (Q1389572) (← links)
- How noise matters. (Q1408710) (← links)
- Network structure and strong equilibrium in route selection games. (Q1414825) (← links)
- Regret-based continuous-time dynamics. (Q1416502) (← links)
- Social optimality and cooperation in nonatomic congestion games. (Q1421898) (← links)
- A Shapley value representation of potential games (Q1566896) (← links)
- Competitive location, production, and market selection (Q1811158) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- Minimality of consistent solutions for strategic games, in particular for potential games (Q1906027) (← links)
- Axiomatic characterizations of solutions for Bayesian games (Q1915817) (← links)
- Potential maximizers and network formation (Q1964741) (← links)
- On the existence of a pure strategy Nash equilibrium in group formation games (Q1978525) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Taxed congestion games with failures (Q2268914) (← links)
- Iterated potential and robustness of equilibria (Q2271379) (← links)