当前位置:
X-MOL 学术
›
arXiv.cs.LO
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Budget-Constrained Coalition Strategies with Discounting
arXiv - CS - Logic in Computer Science Pub Date : 2021-05-10 , DOI: arxiv-2105.04692 Lia Bozzone, Pavel Naumov
arXiv - CS - Logic in Computer Science Pub Date : 2021-05-10 , DOI: arxiv-2105.04692 Lia Bozzone, Pavel Naumov
Discounting future costs and rewards is a common practice in accounting, game
theory, and machine learning. In spite of this, existing logics for reasoning
about strategies with cost and resource constraints do not account for
discounting. The paper proposes a sound and complete logical system for
reasoning about budget-constrained strategic abilities that incorporates
discounting into its semantics.
中文翻译:
有折扣的预算约束联盟策略
在会计,博弈论和机器学习中,折现未来成本和奖励是常见的做法。尽管如此,用于对具有成本和资源约束的策略进行推理的现有逻辑并未考虑折扣。本文提出了一个合理且完整的逻辑系统,用于对预算受限的战略能力进行推理,并将折扣纳入其语义中。
更新日期:2021-05-12
中文翻译:
有折扣的预算约束联盟策略
在会计,博弈论和机器学习中,折现未来成本和奖励是常见的做法。尽管如此,用于对具有成本和资源约束的策略进行推理的现有逻辑并未考虑折扣。本文提出了一个合理且完整的逻辑系统,用于对预算受限的战略能力进行推理,并将折扣纳入其语义中。