Pages that link to "Item:Q1394995"

The following pages link to Supermodular games and potential games. (Q1394995):

Displaying 23 items.

• An application of optimization theory to the study of equilibria for games: a survey (Q301040) (← links)
• Pure strategy equilibria in symmetric two-player zero-sum games (Q444136) (← links)
• Dynamic potential games: the discrete-time stochastic case (Q483902) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• Symmetric versus asymmetric equilibria in symmetric supermodular games (Q956579) (← links)
• The lottery contest is a best-response potential game (Q1673471) (← links)
• \(S\)-modular games, with queueing applications (Q1923641) (← links)
• A survey on decomposition of finite strategic-form games (Q2094087) (← links)
• Strategic decompositions of normal form games: zero-sum games and potential games (Q2195713) (← links)
• Ordinal potentials in smooth games (Q2218540) (← links)
• When is tit-for-tat unbeatable? (Q2248904) (← links)
• Nonspecific networking (Q2344966) (← links)
• \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints (Q2433930) (← links)
• The nonatomic supermodular game (Q2437842) (← links)
• Interactive decisions and potential games (Q2481103) (← links)
• Equilibrium selection in games: the mollifier method (Q2486410) (← links)
• Noncooperative facility location games (Q2643786) (← links)
• Multicriteria games and potentials (Q2644433) (← links)
• An Inverse-Adjusted Best Response Algorithm for Nash Equilibria (Q5114400) (← links)
• Computing Supergame Equilibria (Q5472984) (← links)
• Analysis of the \(n\)-person noncooperative supermodular multiobjective games (Q6106536) (← links)
• Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games (Q6116265) (← links)
• Bilevel Nash equilibrium problems: numerical approximation via direct-search methods (Q6556810) (← links)