阶梯函数连续和有限策略空间积上的三人博弈的均衡堆栈

IF 1.8 Q3 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Foundations of Computing and Decision Sciences Pub Date : 2022-02-01 DOI:10.2478/fcds-2022-0002
V. Romanuke
{"title":"阶梯函数连续和有限策略空间积上的三人博弈的均衡堆栈","authors":"V. Romanuke","doi":"10.2478/fcds-2022-0002","DOIUrl":null,"url":null,"abstract":"Abstract A method of solving a three-person game defined on a product of staircase-function strategy spaces is presented. The spaces can be finite and continuous. The method is based on stacking equilibria of “short” three-person games, each defined on an interval where the pure strategy value is constant. In the case of finite three-person games, which factually are trimatrix games, the equilibria are considered in general terms, so they can be in mixed strategies as well. The stack is any interval-wise combination (succession) of the respective equilibria of the “short” trimatrix games. Apart from the stack, there are no other equilibria in this “long” trimatrix game. An example is presented to show how the stacking is fulfilled for a case of when every “short” trimatrix game has a pure-strategy equilibrium. The presented method, further “breaking” the initial “long” game defined on a product of staircase-function finite spaces, is far more tractable than a straightforward approach to solving directly the “long” trimatrix game would be.","PeriodicalId":42909,"journal":{"name":"Foundations of Computing and Decision Sciences","volume":"47 1","pages":"27 - 64"},"PeriodicalIF":1.8000,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Equilibrium stacks for a three-person game on a product of staircase-function continuous and finite strategy spaces\",\"authors\":\"V. Romanuke\",\"doi\":\"10.2478/fcds-2022-0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A method of solving a three-person game defined on a product of staircase-function strategy spaces is presented. The spaces can be finite and continuous. The method is based on stacking equilibria of “short” three-person games, each defined on an interval where the pure strategy value is constant. In the case of finite three-person games, which factually are trimatrix games, the equilibria are considered in general terms, so they can be in mixed strategies as well. The stack is any interval-wise combination (succession) of the respective equilibria of the “short” trimatrix games. Apart from the stack, there are no other equilibria in this “long” trimatrix game. An example is presented to show how the stacking is fulfilled for a case of when every “short” trimatrix game has a pure-strategy equilibrium. The presented method, further “breaking” the initial “long” game defined on a product of staircase-function finite spaces, is far more tractable than a straightforward approach to solving directly the “long” trimatrix game would be.\",\"PeriodicalId\":42909,\"journal\":{\"name\":\"Foundations of Computing and Decision Sciences\",\"volume\":\"47 1\",\"pages\":\"27 - 64\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2022-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Foundations of Computing and Decision Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/fcds-2022-0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of Computing and Decision Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/fcds-2022-0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

摘要给出了一种在阶梯函数策略空间积上定义的三人对策的求解方法。空间可以是有限的和连续的。该方法基于“短”三人博弈的堆叠均衡,每个博弈在纯策略值恒定的区间内定义。在有限三人博弈的情况下,实际上是三矩阵博弈,均衡被认为是一般的,所以它们也可以是混合策略。堆栈是“短”三矩阵对策的各自均衡的任意间隔组合(连续)。除了堆栈,在这个“长”三矩阵博弈中没有其他均衡。给出了一个例子,说明当每个“短”三矩阵对策都具有纯策略均衡时,如何实现堆叠。所提出的方法,进一步“打破”在阶梯函数有限空间的乘积上定义的初始“长”博弈,比直接解决“长”三矩阵博弈的直接方法要容易得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Equilibrium stacks for a three-person game on a product of staircase-function continuous and finite strategy spaces
Abstract A method of solving a three-person game defined on a product of staircase-function strategy spaces is presented. The spaces can be finite and continuous. The method is based on stacking equilibria of “short” three-person games, each defined on an interval where the pure strategy value is constant. In the case of finite three-person games, which factually are trimatrix games, the equilibria are considered in general terms, so they can be in mixed strategies as well. The stack is any interval-wise combination (succession) of the respective equilibria of the “short” trimatrix games. Apart from the stack, there are no other equilibria in this “long” trimatrix game. An example is presented to show how the stacking is fulfilled for a case of when every “short” trimatrix game has a pure-strategy equilibrium. The presented method, further “breaking” the initial “long” game defined on a product of staircase-function finite spaces, is far more tractable than a straightforward approach to solving directly the “long” trimatrix game would be.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Foundations of Computing and Decision Sciences
Foundations of Computing and Decision Sciences COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE-
CiteScore
2.20
自引率
9.10%
发文量
16
审稿时长
29 weeks
期刊最新文献
A DNA Algorithm for Calculating the Maximum Flow of a Network Traceability of Architectural Design Decisions and Software Artifacts: A Systematic Mapping Study Traveling salesman problem parallelization by solving clustered subproblems Towards automated recommendations for drunk driving penalties in Poland - a case study analysis in selected court Designing a Tri-Objective, Sustainable, Closed-Loop, and Multi-Echelon Supply Chain During the COVID-19 and Lockdowns
×
引用
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