Pages that link to "Item:Q1108914"
From MaRDI portal
The following pages link to An infinite version of Arrow's theorem in the effective setting (Q1108914):
Displaying 6 items.
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- On the independence of core-equivalence results from Zermelo-Fraenkel set theory (Q1263580) (← links)
- Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
