Pages that link to "Item:Q2947564"

The following pages link to The Computational Complexity of Nash Equilibria in Concisely Represented Games (Q2947564):

Displaying 29 items.

• Equilibria of graphical games with symmetries (Q627165) (← links)
• The complexity of game isomorphism (Q650900) (← links)
• Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
• Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
• Ranking games (Q835803) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• Computing equilibria: a computational complexity perspective (Q847807) (← links)
• New complexity results about Nash equilibria (Q932810) (← links)
• Good neighbors are hard to find: Computational complexity of network formation (Q934968) (← links)
• Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
• On computational complexity of membership test in flow games and linear production games (Q1414436) (← links)
• Simulating cardinal preferences in Boolean games: a proof technique (Q1641024) (← links)
• The complexity of decision problems about equilibria in two-player Boolean games (Q1648073) (← links)
• Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
• Logarithmic Query Complexity for Approximate Nash Computation in Large Games (Q2819443) (← links)
• The complexity of computing a Nash equilibrium (Q2931371) (← links)
• Inapproximability of NP-Complete Variants of Nash Equilibrium (Q3088077) (← links)
• (Q3089367) (← links)
• The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
• Weighted Boolean Formula Games (Q3464467) (← links)
• On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
• The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (Q3613786) (← links)
• Inapproximability of Nash Equilibrium (Q4571923) (← links)
• (Q4638112) (← links)
• On Sparse Discretization for Graphical Games (Q5130000) (← links)
• Query complexity of approximate nash equilibria (Q5259589) (← links)
• PPAD-complete approximate pure Nash equilibria in Lipschitz games (Q6069844) (← links)
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
• PPAD-complete pure approximate Nash equilibria in Lipschitz games (Q6164508) (← links)