Consistency for One-Sided Assignment Problems

Détails

Ressource 1Télécharger: REF.pdf (251.48 [Ko])
Etat: Public
Version: Final published version
Licence: Non spécifiée
It was possible to publish this article open access thanks to a Swiss National Licence with the publisher.
ID Serval
serval:BIB_DDB5D5C7D564
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Institution
Titre
Consistency for One-Sided Assignment Problems
Périodique
Social Choice and Welfare
Auteur⸱e⸱s
Klaus B., Nichifor A.
ISSN
0176-1714
Statut éditorial
Publié
Date de publication
2010
Peer-reviewed
Oui
Volume
35
Numéro
3
Pages
415-433
Langue
anglais
Résumé
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 division of payoffs to agents is flexible as part of the solution. We take a similar approach to one-sided assignment problems as Sasaki (Int J Game Theory 24:373-397, 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 [Pareto indifference and consistency] or [invariance with respect to unmatching dummy pairs, continuity, 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 4). 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.
Web of science
Open Access
Oui
Création de la notice
16/03/2010 11:36
Dernière modification de la notice
14/02/2022 7:57
Données d'usage