Pages that link to "Item:Q1191824"

The following pages link to Nash and correlated equilibria: Some complexity considerations (Q1191824):

Displaying 50 items.

• On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
• Equilibria, fixed points, and complexity classes (Q458480) (← links)
• Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
• On Stackelberg mixed strategies (Q516242) (← links)
• Generalized correlated equilibrium for two-person games in extensive form with perfect information (Q539469) (← links)
• Bottom-up design of strategic options as finite automata (Q601965) (← links)
• Correlated equilibria in continuous games: characterization and computation (Q632966) (← links)
• A FPTAS for computing a symmetric leontief competitive economy equilibrium (Q662291) (← links)
• Interdependent defense games with applications to internet security at the level of autonomous systems (Q725097) (← links)
• An interior-point path-following algorithm for computing a Leontief economy equilibrium (Q763393) (← links)
• On total functions, existence theorems and computational complexity (Q808245) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• Homotopy methods to compute equilibria in game theory (Q847802) (← links)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• Enumeration of Nash equilibria for two-player games (Q847809) (← links)
• The computational complexity of evolutionarily stable strategies (Q926196) (← links)
• New complexity results about Nash equilibria (Q932810) (← 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)
• The complexity of equilibria: Hardness results for economies via a correspondence with games (Q959811) (← links)
• Well supported approximate equilibria in bimatrix games (Q973002) (← links)
• Imitation games and computation (Q993779) (← links)
• The myth of the folk theorem (Q993783) (← links)
• Commitment games (Q1021610) (← links)
• Reasoning about temporal properties of rational play (Q1028639) (← links)
• Perspectives on multiagent learning (Q1028921) (← links)
• Perfect communication equilibria in repeated games with imperfect monitoring (Q1036596) (← 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)
• Computational complexity in additive hedonic games (Q1046065) (← links)
• The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor (Q1194060) (← links)
• The complexity of two-person zero-sum games in extensive form (Q1195597) (← 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)
• The complexity of decision problems about equilibria in two-player Boolean games (Q1648073) (← links)
• Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
• Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition (Q1706316) (← links)
• Inapproximability results for constrained approximate Nash equilibria (Q1784945) (← links)
• Parameterized two-player Nash equilibrium (Q1949741) (← links)
• The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← 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)
• Bounded rationality in learning, perception, decision-making, and stochastic games (Q2094047) (← links)
• Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
• Automatic verification of concurrent stochastic systems (Q2147696) (← links)
• Simple complexity from imitation games (Q2268119) (← links)
• Computer science and decision theory (Q2271874) (← links)