Pages that link to "Item:Q932813"
From MaRDI portal
The following pages link to Simple search methods for finding a Nash equilibrium (Q932813):
Displaying 31 items.
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- On Stackelberg mixed strategies (Q516242) (← links)
- Computational analysis of perfect-information position auctions (Q523528) (← links)
- Action-graph games (Q625044) (← links)
- Finding all Nash equilibria of a finite game using polynomial algebra (Q847806) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Enumeration of Nash equilibria for two-player games (Q847809) (← links)
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies (Q903026) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Imitation games and computation (Q993779) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- Successful Nash equilibrium agent for a three-player imperfect-information game (Q1651920) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition (Q1706316) (← links)
- Incentive-based search for equilibria in Boolean games (Q2009196) (← links)
- Solving possibilistic games with incomplete information (Q2077019) (← links)
- Computing equilibria for integer programming games (Q2160491) (← links)
- Behavioural strategies in weighted Boolean games (Q2225600) (← links)
- Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
- Two-player simultaneous location game: preferential rights and overbidding (Q2355898) (← links)
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents (Q2384141) (← links)
- A global optimization algorithm for solving a four-person game (Q2421448) (← links)
- Robust game theory (Q2492691) (← links)
- Graph transduction as a noncooperative game (Q2885112) (← links)
- Empirical Distribution of Equilibrium Play and Its Testing Application (Q2976138) (← links)
- Smoothing Techniques for Computing Nash Equilibria of Sequential Games (Q3169104) (← links)
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir (Q5212850) (← links)
- Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games (Q6119818) (← links)
- Correlated equilibria and fairness in concurrent stochastic games (Q6535606) (← links)
- Stationary equilibria in discounted stochastic games (Q6556809) (← links)
- A non-cooperative multi-leader one-follower integrated generation maintenance scheduling problem under the risk of generation units' disruption and variation in demands (Q6573323) (← links)