Pages that link to "Item:Q1195597"

The following pages link to The complexity of two-person zero-sum games in extensive form (Q1195597):

Displayed 9 items.

• New complexity results about Nash equilibria (Q932810) ‎ (← links)
• Good neighbors are hard to find: Computational complexity of network formation (Q934968) ‎ (← links)
• Team-maxmin equilibria (Q1378009) ‎ (← links)
• The independent choice logic for modelling multiple agents under uncertainty (Q1391346) ‎ (← links)
• Representations and solutions for game-theoretic problems (Q1391352) ‎ (← links)
• Propositional logic of imperfect information: Foundations and applications (Q1422098) ‎ (← links)
• Finding mixed strategies with small supports in extensive form games (Q1814784) ‎ (← links)
• On the computational consequences of independence in propositional logic (Q2500830) ‎ (← links)
• A Logic for Reasoning about Rational Agents (Q3602940) ‎ (← links)