Nonanonymity and sensitivity of computable simple games
Year of publication: |
2004
|
---|---|
Authors: | Mihara, H. Reiju |
Published in: |
Mathematical social sciences. - Amsterdam [u.a.] : NH, Elsevier, ISSN 0165-4896, ZDB-ID 283230-6. - Vol. 48.2004, 3, p. 329-341
|
Subject: | Spieltheorie | Game theory | Koalition | Coalition |
-
Pareto optimal coalitions of fixed size
Cseh, Ágnes, (2020)
-
Collaborative operating room planning and scheduling
Roshanaei, Vahid, (2017)
-
Game-theoretic principles of decision management modeling under the coopetition
Heiets, Iryna, (2021)
- More ...
-
Coalitionally strategyproof functions depend only on the most-preferred alternatives
Mihara, H. Reiju, (2000)
-
Arrow's Theorem and Turing computability
Mihara, H. Reiju, (1997)
-
Preference aggregation theory without acyclicity: The core without majority dissatisfaction
Kumabe, Masahiro, (2008)
- More ...