Pages that link to "Item:Q3202087"
From MaRDI portal
The following pages link to Complexity of games and bounded rationality (Q3202087):
Displaying 7 items.
- Computational complexity in additive hedonic games (Q1046065) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making (Q1196206) (← links)
- Precise complexity of the core in dichotomous and additive hedonic games (Q1990301) (← links)
- Simple complexity from imitation games (Q2268119) (← links)
- Games of constraints for complex systems (Q2319683) (← links)
- Indices of Criticality in Simple Games (Q3299282) (← links)