On the solvability of three-agent task allocation with unqualified agents priority structures

摘要

In this paper, we study the problem of solvability for task allocation with unqualified agents (TAU) priority structures proposed by Ehlers and Westkamp (Theor Econ 13:1009-1041, 2018). In the TAU priority structure, at any position, either all agents have equal priority, or there exists exactly one agent who has the lowest priority and all others have equal highest priority. A priority structure is solvable if it admits a constrained efficient and strategy-proof mechanism, where a constrained efficient mechanism always produces a stable matching which can not be Pareto dominated by any other stable matching. We show that TAU priority structures with three agents are solvable via a top trading cycles mechanism with endogenous tie-breaking rules.

关键词