Pages that link to "Item:Q1763192"
From MaRDI portal
The following pages link to Nonanonymity and sensitivity of computable simple games (Q1763192):
Displaying 7 items.
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- Continuity of social choice functions with restricted coalition algebras (Q2642552) (← links)
- (Q2949135) (← links)
- On the Complexity of Non-reversible Betting Games on Many-Valued Events (Q3163975) (← links)