论不合格代理优先权结构下三代理任务分配的可解性

IF 0.3 4区 经济学 Q4 ECONOMICS
Yu Gu, Yongchao Zhang
{"title":"论不合格代理优先权结构下三代理任务分配的可解性","authors":"Yu Gu, Yongchao Zhang","doi":"10.1007/s10058-023-00346-6","DOIUrl":null,"url":null,"abstract":"<p>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.\n</p>","PeriodicalId":44537,"journal":{"name":"Review of Economic Design","volume":"3 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the solvability of three-agent task allocation with unqualified agents priority structures\",\"authors\":\"Yu Gu, Yongchao Zhang\",\"doi\":\"10.1007/s10058-023-00346-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>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.\\n</p>\",\"PeriodicalId\":44537,\"journal\":{\"name\":\"Review of Economic Design\",\"volume\":\"3 1\",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Review of Economic Design\",\"FirstCategoryId\":\"96\",\"ListUrlMain\":\"https://doi.org/10.1007/s10058-023-00346-6\",\"RegionNum\":4,\"RegionCategory\":\"经济学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Review of Economic Design","FirstCategoryId":"96","ListUrlMain":"https://doi.org/10.1007/s10058-023-00346-6","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了 Ehlers 和 Westkamp(Theor Econ 13:1009-1041, 2018)提出的无资质代理(TAU)优先级结构任务分配的可解性问题。在TAU优先级结构中,在任意位置,要么所有代理人的优先级相等,要么正好存在一个优先级最低的代理人,而其他代理人的优先级相等,且所有代理人的优先级最高。如果一个优先级结构允许一个有约束的高效且不失策略的机制,那么它就是可解的,其中一个有约束的高效机制总是能产生一个稳定匹配,而这个稳定匹配不可能被任何其他稳定匹配所帕累托支配。我们的研究表明,有三个代理人的 TAU 优先权结构是可以通过具有内生平局打破规则的顶级交易循环机制来解决的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

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

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.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.80
自引率
28.60%
发文量
37
期刊介绍: Review of Economic Design comprises the creative art and science of inventing, analyzing and testing economic as well as social and political institutions and mechanisms aimed at achieving individual objectives and social goals. In this age of Economic Design, the accumulated traditions and wealth of knowledge in normative and positive economics and the strategic analysis of game theory are applied with novel ideas in the creative tasks of designing and assembling diverse legal-economic instruments. These include constitutions and other assignments of rights, mechanisms for allocation or regulation, tax and incentive schemes, contract forms, voting and other choice aggregation procedures, markets, auctions, organizational forms, such as partnerships, together with supporting membership and other property rights, and information systems. These designs, the methods of analysis used in their scrutiny, as well as the mathematical techniques and empirical knowledge they employ, along with comparative assessments of the performance of known economic systems and implemented designs, all of these form natural components of the subject matter of Economic Design. Officially cited as: Rev Econ Design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信