The subset agreement problem generalizes all forms of two-sided matching. Two agents need to agree on some subset of a given finite set of contracts. A solution concept - agreement - generalizes the notion of a stable subset. Its definition does not require the consideration of a preference ordering on sets of contracts, but only that of the choice function that reveals the agents' preferences by choosing the best subset of any given set of contracts. Under a suitable condition, called coherence, that requires that contracts are substitutes to one another, at least one greement always exists. A constructive proof is given that the structure of the set of agreements is a lattice.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem in its series Discussion Paper Series with number
dp501.
For technical questions regarding this item, or to correct its listing, contact: (Ron Peretz).
Related research
Keywords:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
John William Hatfield & Paul R. Milgrom, 2005.
"Matching with Contracts,"
American Economic Review,
American Economic Association, vol. 95(4), pages 913-935, September.
[Downloadable!]
Other versions:
Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986.
"Multi-Item Auctions,"
Journal of Political Economy,
University of Chicago Press, vol. 94(4), pages 863-72, August.
[Downloadable!] (restricted)
Did you know? You can include your works in the database easily by uploading them on the Munich Personal RePEc Archive (MPRA) if you do not have access to an institutional RePEc archive.