Pages that link to "Item:Q932810"

The following pages link to New complexity results about Nash equilibria (Q932810):

Displaying 50 items.

• Belief and truth in hypothesised behaviours (Q274416) (← links)
• The complexity of equilibria for risk-modeling valuations (Q284585) (← links)
• Constructive proof of the existence of Nash equilibrium in a finite strategic game with sequentially locally nonconstant payoff functions (Q408489) (← links)
• Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
• Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
• On Stackelberg mixed strategies (Q516242) (← links)
• Action-graph games (Q625044) (← links)
• Infection and immunization: a new class of evolutionary game dynamics (Q625047) (← links)
• Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
• Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• The computational complexity of evolutionarily stable strategies (Q926196) (← links)
• Simple search methods for finding a Nash equilibrium (Q932813) (← links)
• Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
• The complexity of uniform Nash equilibria and related regular subgraph problems (Q935157) (← links)
• On the complexity of deciding bimatrix games similarity (Q955038) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Well supported approximate equilibria in bimatrix games (Q973002) (← links)
• Imitation games and computation (Q993779) (← links)
• Reasoning about temporal properties of rational play (Q1028639) (← links)
• Perspectives on multiagent learning (Q1028921) (← links)
• On the computational complexity of Nash equilibria for \((0,1)\) bimatrix games (Q1041739) (← links)
• On the complexity of market equilibria with maximum social welfare (Q1044745) (← links)
• An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
• Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
• Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
• Graded modalities in strategy logic (Q1641034) (← links)
• Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
• Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
• Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
• Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
• The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
• Strong Nash equilibria and mixed strategies (Q2021821) (← links)
• Game theory on attack graph for cyber deception (Q2056965) (← links)
• Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
• Simple complexity from imitation games (Q2268119) (← links)
• Computing the strong \(L_p\)-Nash equilibrium for Markov chains games: convergence and uniqueness (Q2284447) (← links)
• Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games (Q2308184) (← links)
• Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
• On the convergence of multicast games in directed networks (Q2379922) (← links)
• AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents (Q2384141) (← links)
• Directed graphical structure, Nash equilibrium, and potential games (Q2417148) (← links)
• The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
• The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
• A sequential Stackelberg game for dynamic inspection problems (Q2672097) (← links)
• The Exact Computational Complexity of Evolutionarily Stable Strategies (Q2937749) (← links)
• On Pure Nash Equilibria in Stochastic Games (Q2948480) (← links)
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
• Computing Equilibria with Partial Commitment (Q2959814) (← links)