公平除法问题的初级解决方案

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Problems of Information Transmission Pub Date : 2024-08-07 DOI:10.1134/s003294602401006x

M. L. Blank, M. O. Polyakov

{"title":"公平除法问题的初级解决方案","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":"13 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":\"13 1\",\"pages\":\"\"},\"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}","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

摘要

本文提出了一种相对简单的新方法，用于解决在多个参与者之间公平分配连续资源（可测量的空间、饼等）的问题，这些参与者的选择标准由收费（有符号的度量）来描述。首次考虑了收费问题的设置。这个问题归结为分析在有限可测分区空间中作用的特殊构造的动力系统的轨迹特性。在真实度量和带电荷的情况下，都证明了向极限解的指数级快速收敛。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Elementary Solution to the Fair Division Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Problems of Information Transmission 工程技术-计算机：理论方法

CiteScore

2.00

自引率

25.00%

发文量

审稿时长

>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.