Elementary Solution to the Fair Division Problem

IF 0.5 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
M. L. Blank, M. O. Polyakov
{"title":"Elementary Solution to the Fair Division Problem","authors":"M. L. Blank, M. O. Polyakov","doi":"10.1134/s003294602401006x","DOIUrl":null,"url":null,"abstract":"<p>A new and relatively elementary approach is proposed for solving the problem of fair division of a continuous resource (measurable space, pie, etc.) between several participants, the selection criteria of which are described by charges (signed measures). The setting of the problem with charges is considered for the first time. The problem comes down to analyzing properties of trajectories of a specially constructed dynamical system acting in the space of finite measurable partitions. Exponentially fast convergence to a limit solution is proved for both the case of true measures and the case of charges.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s003294602401006x","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

A new and relatively elementary approach is proposed for solving the problem of fair division of a continuous resource (measurable space, pie, etc.) between several participants, the selection criteria of which are described by charges (signed measures). The setting of the problem with charges is considered for the first time. The problem comes down to analyzing properties of trajectories of a specially constructed dynamical system acting in the space of finite measurable partitions. Exponentially fast convergence to a limit solution is proved for both the case of true measures and the case of charges.

公平除法问题的初级解决方案
本文提出了一种相对简单的新方法,用于解决在多个参与者之间公平分配连续资源(可测量的空间、饼等)的问题,这些参与者的选择标准由收费(有符号的度量)来描述。首次考虑了收费问题的设置。这个问题归结为分析在有限可测分区空间中作用的特殊构造的动力系统的轨迹特性。在真实度量和带电荷的情况下,都证明了向极限解的指数级快速收敛。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Problems of Information Transmission
Problems of Information Transmission 工程技术-计算机:理论方法
CiteScore
2.00
自引率
25.00%
发文量
10
审稿时长
>12 weeks
期刊介绍: Problems of Information Transmission is of interest to researcher in all fields concerned with the research and development of communication systems. This quarterly journal features coverage of statistical information theory; coding theory and techniques; noisy channels; error detection and correction; signal detection, extraction, and analysis; analysis of communication networks; optimal processing and routing; the theory of random processes; and bionics.
文献相关原料
公司名称 产品信息 采购帮参考价格
×
引用
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学术官方微信