The following pages link to H. Reiju Mihara (Q536091):
Displaying 11 items.
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction (Q536092) (← links)
- Computability of simple games: a complete investigation of the sixty-four possibilities (Q553522) (← links)
- The Nakamura numbers for computable simple games (Q1038709) (← links)
- Arrow's theorem and Turing computability (Q1365367) (← links)
- Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras (Q1374816) (← links)
- Nonanonymity and sensitivity of computable simple games (Q1763192) (← links)
- Arrow's theorem, countably many agents, and more visible invisible dictators (Q1961954) (← links)
- Coalitionally strategyproof functions depend only on the most-preferred alternatives (Q2388760) (← links)
- Existence of a coalitionally strategyproof social choice function: a constructive proof (Q2388818) (← links)
- Computability of simple games: A characterization and application to the core (Q2482640) (← links)
- (Q4511547) (← links)
