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.
- 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)
- Coordination games on graphs (Q1677255) (← links)
- Weakly-acyclic (internet) routing games (Q1678767) (← links)
- Efficiency in a forced contribution threshold public good game (Q1684135) (← links)
- Incomplete-profile potential games (Q1707857) (← 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)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Potential maximizers and network formation (Q1964741) (← links)
- On the existence of a pure strategy Nash equilibrium in group formation games (Q1978525) (← links)
- Strategies and evolution in the minority game: a multi-round strategy experiment (Q2016222) (← links)
- Approximate Nash equilibria in anonymous games (Q2253838) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← 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)
- A testable model of consumption with externalities (Q2271382) (← links)
- Nonspecific networking (Q2344966) (← links)
- Self-organizing flows in social networks (Q2345453) (← links)
- Enforcing efficient equilibria in network design games via subsidies (Q2345938) (← links)
- Equilibrium routing under uncertainty (Q2349119) (← links)
- The structure of utility functions ensuring the existence of an exact potential in a strategic game (Q2358599) (← links)
- A survey of static and dynamic potential games (Q2360803) (← links)
- Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- The cutting power of preparation (Q2379185) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- Congestion games revisited (Q2384723) (← links)
- Improved lower bounds on the price of stability of undirected network design games (Q2392248) (← links)