H. Reiju Mihara

Available identifiers

zbMath Open mihara.h-reijuMaRDI QIDQ536091

List of research outcomes

Publication	Date of Publication	Type
Computability of simple games: a complete investigation of the sixty-four possibilities	2011-07-27	Paper
Preference aggregation theory without acyclicity: the core without majority dissatisfaction	2011-05-16	Paper
The Nakamura numbers for computable simple games	2009-11-20	Paper
Computability of simple games: A characterization and application to the core	2008-04-23	Paper
Coalitionally strategyproof functions depend only on the most-preferred alternatives	2005-09-20	Paper
Existence of a coalitionally strategyproof social choice function: a constructive proof	2005-09-20	Paper
Nonanonymity and sensitivity of computable simple games	2005-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4511547	2001-10-26	Paper
Arrow's theorem, countably many agents, and more visible invisible dictators	2001-03-04	Paper
Arrow's theorem and Turing computability	1998-03-10	Paper
Anonymity and neutrality in Arrow's Theorem with restricted coalition algebras	1997-12-11	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: H. Reiju Mihara