Consistency and Monotonicity in Assignment Problems

Hiroo Sasaki

International Journal of Game Theory, 1995, vol. 24, issue 4, 373-97

Abstract: This paper presents axiomatic characterizations of the core of assignment problems. In the main axiomatization theorem we use six axioms including the consistency (CONS) and the weak pairwise-monotonicity (W.P.MON) which are firstly proposed and defined for this setup in the present paper. Since an assignment problem may be converted into a model of a private ownership economy with indivisible goods and the core of the assignment problems coincides with the set of the competitive allocations of the economy, our characterization theorems also give axiomatic characterizations of the set of competitive allocations. Because the consistency is a desirable property of resource allocation mechanisms, our main result gives a new normative implication of competitive equilibria.

Date: 1995
References: Add references at CitEc
Citations: View citations in EconPapers (18)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:24:y:1995:i:4:p:373-97

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().