Equilibrium in the problem of choosing the meeting time for N persons

IF 0.3 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
V. Mazalov, Vladimir V. Yashin
{"title":"Equilibrium in the problem of choosing the meeting time for N persons","authors":"V. Mazalov, Vladimir V. Yashin","doi":"10.21638/11701/spbu10.2022.405","DOIUrl":null,"url":null,"abstract":"A game-theoretic model of competitive decision on a meet time is considered. There are n players who are negotiating the meeting time. The objective is to find a meet time that satisfies all participants. The players' utilities are represented by linear unimodal functions ui(x), x∈ [0, 1], i=1,2,...,n. The maximum values of the utility functions are located at the points i/(n-1), i=0,...,n-1. Players take turns 1 → 2→ 3 → ...→ (n-1) → n → 1→... . Players can indefinitely insist on a profitable solution for themselves. To prevent this from happening, a discounting factor δ is greater than 1 is introduced to limit the duration of negotiations. We will assume that after each negotiation session, the utility functions of all players will decrease proportionally to δ. Thus, if the players have not come to a decision before time t, then at time t their utilities are represented by the functions δt-1ui(x), i = 1, 2,..., n. We will look for a solution in the class of stationary strategies, when it is assumed that the decisions of the players will not change during the negotiation time, i. e. the player i will make the same offer at step i and at subsequent steps n+i, 2n+i, ... . This will allow us to limit ourselves to considering the chain of sentences 1 → 2 → 3 → ... →(n-1) → n→ 1. We will use the method of backward induction. To do this, assume that player n is looking for his best responce, knowing player 1's proposal, then player (n-1) is looking for his best responce, knowing player n's solution, etc. In the end, we find the best responce of the player 1, and it should coincide with his offer at the beginning of the procedure. Thus, the reasoning in the method of backward induction has the form 1 ← 2← 3← ... ←(n-1)← n← 1. The subgame perfect equilibrium in the class of stationary strategies is found in analytical form. It is shown that when δ changes from 1 to 0, the optimal offer of player 1 changes from 1/2 to 1. That is, when the value of δ is close to 1, the players have a lot of time to negotiate, so the offer of player 1 should be fair to everyone. If the discounting factor is close to 0, the utilities of the players decreases rapidly and they must quickly make a decision that is beneficial to player 1.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":"7 1","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu10.2022.405","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 1

Abstract

A game-theoretic model of competitive decision on a meet time is considered. There are n players who are negotiating the meeting time. The objective is to find a meet time that satisfies all participants. The players' utilities are represented by linear unimodal functions ui(x), x∈ [0, 1], i=1,2,...,n. The maximum values of the utility functions are located at the points i/(n-1), i=0,...,n-1. Players take turns 1 → 2→ 3 → ...→ (n-1) → n → 1→... . Players can indefinitely insist on a profitable solution for themselves. To prevent this from happening, a discounting factor δ is greater than 1 is introduced to limit the duration of negotiations. We will assume that after each negotiation session, the utility functions of all players will decrease proportionally to δ. Thus, if the players have not come to a decision before time t, then at time t their utilities are represented by the functions δt-1ui(x), i = 1, 2,..., n. We will look for a solution in the class of stationary strategies, when it is assumed that the decisions of the players will not change during the negotiation time, i. e. the player i will make the same offer at step i and at subsequent steps n+i, 2n+i, ... . This will allow us to limit ourselves to considering the chain of sentences 1 → 2 → 3 → ... →(n-1) → n→ 1. We will use the method of backward induction. To do this, assume that player n is looking for his best responce, knowing player 1's proposal, then player (n-1) is looking for his best responce, knowing player n's solution, etc. In the end, we find the best responce of the player 1, and it should coincide with his offer at the beginning of the procedure. Thus, the reasoning in the method of backward induction has the form 1 ← 2← 3← ... ←(n-1)← n← 1. The subgame perfect equilibrium in the class of stationary strategies is found in analytical form. It is shown that when δ changes from 1 to 0, the optimal offer of player 1 changes from 1/2 to 1. That is, when the value of δ is close to 1, the players have a lot of time to negotiate, so the offer of player 1 should be fair to everyone. If the discounting factor is close to 0, the utilities of the players decreases rapidly and they must quickly make a decision that is beneficial to player 1.
N人会议时间选择问题的均衡性
考虑了一个会议时间竞争决策的博弈论模型。有n个玩家在协商会议时间。目标是找到一个满足所有参与者的见面时间。玩家的效用用线性单峰函数ui(x)表示,x∈[0,1],i=1,2,…,n。效用函数的最大值位于点i/(n-1), i=0,…,n-1。玩家轮流1→2→3→…→(n-1)→n→1→... .玩家可以无限期地为自己坚持一个有利可图的解决方案。为了防止这种情况发生,引入一个大于1的折现因子δ来限制谈判的持续时间。我们将假设在每次谈判之后,所有参与者的效用函数将成比例地减小到δ。因此,如果参与者在时间t之前没有做出决定,那么在时间t时,他们的效用由函数δt-1ui(x)表示,i = 1,2,…, n。我们将在平稳策略类中寻找一个解,当假设参与人的决策在谈判时间内不会改变,即参与人i在步骤i和后续步骤n+i, 2n+i, ... .给出相同的报价这将允许我们把自己限制在考虑句子链1→2→3→…→(n-1)→n→1。我们将使用逆向归纳法。要做到这一点,假设参与人n正在寻找他的最佳对策,知道参与人1的建议,然后参与人(n-1)正在寻找他的最佳对策,知道参与人n的解决方案,等等。最后,我们找到参与人1的最佳对策,它应该与程序开始时的提议一致。因此,逆向归纳法中的推理形式为1←2←3←…←(n-1)←n←1。用解析的形式找到了一类平稳策略的子博弈完全均衡。结果表明,当δ从1变为0时,参与人1的最优报价从1/2变为1。也就是说,当δ值接近1时,参与人有很多时间进行谈判,因此参与人1的出价应该对每个人都公平。如果折现系数接近于0,则参与者的效用迅速下降,他们必须迅速做出有利于参与者1的决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.30
自引率
50.00%
发文量
10
期刊介绍: The journal is the prime outlet for the findings of scientists from the Faculty of applied mathematics and control processes of St. Petersburg State University. It publishes original contributions in all areas of applied mathematics, computer science and control. Vestnik St. Petersburg University: Applied Mathematics. Computer Science. Control Processes features articles that cover the major areas of applied mathematics, computer science and control.
×
引用
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学术官方微信