English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/125637
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

On the Exhaustiveness of Truncation and Dropping Strategies in Many-to-Many Matching Markets

AutorJaramillo, Paula; Kayi, Çagatay; Klijn, Flip
Fecha de publicación4-jul-2014
CitaciónSocial Choice and Welfare 42(4): 793-811 (2014)
ResumenWe consider two-sided many-to-many matching markets in which each worker maywork for multiple firms and each firmmay hire multipleworkers.We study individual and group manipulations in centralized markets that employ (pairwise) stable mechanisms and that require participants to submit rank order lists of agents on the other side of the market. We are interested in simple preference manipulations that have been reported and studied in empirical and theoretical work: truncation strategies, which are the lists obtained by removing a tail of least preferred partners from a preference list, and the more general dropping strategies, which are the lists obtained by only removing partners from a preference list (i.e., no reshuffling). We study when truncation/dropping strategies are exhaustive for a group of agents on the same side of themarket, i.e., when each match resulting from preference manipulations can be replicated or improved upon by some truncation/dropping strategies.We prove that for each stable mechanism, dropping strategies are exhaustive for each group of agents on the same side of the market (Theorem 1), i.e., independently of the quotas. Then, we show that for each stable mechanism, truncation strategies are exhaustive for each agent with quota 1 (Theorem 2). Finally, we show that this result cannot be extended neither to individual manipulations when the agent’s quota is larger than 1 (even when all other agents’ quotas equal 1—Example 1), nor to group manipulations (even when all quotas equal 1—Example 2). © 2013, Springer-Verlag Berlin Heidelberg.
Versión del editorhttp://dx.doi.org/10.1007/s00355-013-0746-y
Identificadoresissn: 0176-1714
Aparece en las colecciones: (IAE) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
Klijn-SocialChoiceWelfate-2014-v42-p793.pdf428,16 kBAdobe PDFVista previa
Mostrar el registro completo

NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.