This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Consistency and Monotonicity in One-Sided Assignment Problems

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Bettina-Elisabeth Klaus () (Harvard Business School, Negotiation, Organizations & Markets Unit)
Alexandru Nichifor () (Department of Economics, Maastricht University)

Additional information is available for the following registered author(s):

Abstract

One-sided assignment problems combine important features of two well-known matching models. First, as in roommate problems, any two agents can be matched and second, as in two-sided assignment problems, the payoffs of a matching can be divided between the agents. We take a similar approach to one-sided assignment problems as Sasaki (1995) for two-sided assignment problems and we analyze various desirable properties of solutions including consistency and weak pairwise-monotonicity. We show that for the class of solvable one-sided assignment problems (i.e., the subset of one-sided assignment problems with a non-empty core), if a subsolution of the core satisfies [indifference with respect to dummy agents, continuity, and consistency] or [Pareto indifference and consistency], then it coincides with the core (Theorems 1 and 2). However, we also prove that on the class of all one-sided assignment problems (solvable or not), no solution satisfies consistency and coincides with the core whenever the core is non-empty (Theorem 3). Finally, we comment on the difficulty in obtaining further positive results for the class of solvable one-sided assignment problems in line with Sasaki's (1995) characterizations of the core for two-sided assignment problems.

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.

File URL: http://www.hbs.edu/research/pdf/09-146.pdf
File Format: application/pdf
File Function:
Download Restriction: no

Publisher Info
Paper provided by Harvard Business School in its series Harvard Business School Working Papers with number 09-146.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length: 19 pages
Date of creation: Jun 2009
Date of revision:
Handle: RePEc:hbs:wpaper:09-146

Contact details of provider:
Postal: Soldiers Field, Boston, Massachusetts 02163
Phone: 617.495.6000
Web page: http://www.hbs.edu/
More information through EDIRC

For technical questions regarding this item, or to correct its listing, contact: (Soebagio Notosoehardjo).

Related research
Keywords: (One-sided) assignment problems; consistency; core; matching.;

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement

This paper has been announced in the following NEP Reports:

Statistics
Access and download statistics

Did you know? RePEc encourages publishers to make their bibliographic data freely available to the public.

This page was last updated on 2009-11-19.


This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.