EconPapers    
Economics at your fingertips  
 

Serial Top Trading Cycles and the Exclusion Core in Mixed-Ownership Object Allocation Problems

Bettina Klaus (), Yang Chen and Anh Tri\^eu

Papers from arXiv.org

Abstract: We study Balbuzanov and Kotowski's (2019) exclusion core for object allocation problems with complex endowments. We focus on mixed-ownership object allocation problems in which each object is either individually owned by one agent or publicly owned by all agents. Given a priority order over agents, an endowment structure, an initial allocation, and agents' preferences, we construct serial top trading cycles (STTC) graphs and define the associated STTC algorithm. The algorithm is the central tool for our analysis of exclusion-core-stable allocations. First, we show that, among domains defined by restrictions on endowment structures, the mixed-ownership domain is the largest on which the STTC algorithms characterize the exclusion core. Second, we provide a simple test for exclusion core stability: an allocation is exclusion core stable if and only if it is a fixed point of the STTC algorithm initialized at that allocation, independently of the priority order. Third, we show that the exclusion core is a von Neumann--Morgenstern (1944) stable set with respect to exclusion-domination. Finally, we study a dynamic exclusion-blocking process and show that, from any allocation, there exists a self-contained exclusion-blocking path to the exclusion core.

Date: 2026-10
References: Add references at CitEc
Citations:

Downloads: (external link)
https://arxiv.org/pdf/2610.04015 Latest version (application/pdf)

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:arx:papers:2610.04015

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().

 
Page updated 2026-10-16
Handle: RePEc:arx:papers:2610.04015