On the decomposability of fractional allocations

IF 0.5 4区 经济学 Q4 ECONOMICS Mathematical Social Sciences Pub Date : 2024-10-28 DOI:10.1016/j.mathsocsci.2024.10.002
Shurojit Chatterji , Peng Liu
{"title":"On the decomposability of fractional allocations","authors":"Shurojit Chatterji ,&nbsp;Peng Liu","doi":"10.1016/j.mathsocsci.2024.10.002","DOIUrl":null,"url":null,"abstract":"<div><div>A common practice in dealing with the allocation of indivisible objects is to treat them as infinitely divisible and specify a fractional allocation, which is then implemented as a lottery on integer allocations that are feasible. The question we study is whether an arbitrary fractional allocation can be decomposed as a lottery on an arbitrary set of feasible integer allocations. The main result is a characterization of decomposable fractional allocations, that is obtained by transforming the decomposability problem into a maximum flow problem. We also provide a separate necessary condition for decomposability.</div></div>","PeriodicalId":51118,"journal":{"name":"Mathematical Social Sciences","volume":"132 ","pages":"Pages 79-89"},"PeriodicalIF":0.5000,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Social Sciences","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0165489624000908","RegionNum":4,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

Abstract

A common practice in dealing with the allocation of indivisible objects is to treat them as infinitely divisible and specify a fractional allocation, which is then implemented as a lottery on integer allocations that are feasible. The question we study is whether an arbitrary fractional allocation can be decomposed as a lottery on an arbitrary set of feasible integer allocations. The main result is a characterization of decomposable fractional allocations, that is obtained by transforming the decomposability problem into a maximum flow problem. We also provide a separate necessary condition for decomposability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论分数分配的可分解性
在处理不可分割对象的分配问题时,一种常见的做法是将它们视为无限可分的对象,并指定一种分数分配,然后在可行的整数分配上以抽签的形式来实现。我们要研究的问题是,任意小数分配是否可以分解为任意可行整数分配集合上的抽签。主要结果是对可分解分数分配的描述,它是通过将可分解性问题转化为最大流量问题而得到的。我们还为可分解性提供了一个单独的必要条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Mathematical Social Sciences
Mathematical Social Sciences 数学-数学跨学科应用
CiteScore
1.30
自引率
0.00%
发文量
55
审稿时长
59 days
期刊介绍: The international, interdisciplinary journal Mathematical Social Sciences publishes original research articles, survey papers, short notes and book reviews. The journal emphasizes the unity of mathematical modelling in economics, psychology, political sciences, sociology and other social sciences. Topics of particular interest include the fundamental aspects of choice, information, and preferences (decision science) and of interaction (game theory and economic theory), the measurement of utility, welfare and inequality, the formal theories of justice and implementation, voting rules, cooperative games, fair division, cost allocation, bargaining, matching, social networks, and evolutionary and other dynamics models. Papers published by the journal are mathematically rigorous but no bounds, from above or from below, limits their technical level. All mathematical techniques may be used. The articles should be self-contained and readable by social scientists trained in mathematics.
期刊最新文献
Project selection with partially verifiable information On the decomposability of fractional allocations Node centrality based on its edges importance: The Position centrality Evidence disclosure with heterogeneous priors Very weakly dominant strategies
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1