Pages that link to "Item:Q1920963"
From MaRDI portal
The following pages link to Non-computable strategies and discounted repeated games (Q1920963):
Displayed 7 items.
- Competitive equilibrium with intuitionistic agents (Q408315) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Equilibrium paths in discounted supergames (Q1741494) (← links)
- Computable preference and utility (Q1961959) (← links)
- Verified Methods for Computing Pareto Sets: General Algorithmic Analysis (Q2930551) (← links)
- The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation (Q4606776) (← links)
- A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff (Q6090449) (← links)