Pages that link to "Item:Q1414388"
From MaRDI portal
The following pages link to On the NP-completeness of finding an optimal strategy in games with common payoffs (Q1414388):
Displaying 9 items.
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Finding all equilibria in games of strategic complements (Q996391) (← links)
- Reasoning about temporal properties of rational play (Q1028639) (← links)
- Games against nature (Q1069296) (← links)
- Satisfying and optimality in \(2\times 2\) common interest games (Q1285889) (← links)
- A note on the complexity of determining optimal strategies in games with common payoffs (Q1416783) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms (Q2957451) (← links)
- A Logic for Reasoning about Rational Agents (Q3602940) (← links)