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 |
-
Collaborative operating room planning and scheduling
Roshanaei, Vahid, (2017)
-
Pareto optimal coalitions of fixed size
Cseh, Ágnes, (2020)
-
Self-enforcing capital tax coordination
Eichner, Thomas, (2013)
- More ...
-
Preference aggregation theory without acyclicity: The core without majority dissatisfaction
Kumabe, Masahiro, (2010)
-
Computability of simple games: A complete investigation of the sixty-four possibilities
Kumabe, Masahiro, (2011)
-
The second-price auction solves King Solomon's dilemma
Mihara, H. Reiju, (2011)
- More ...