paperbot · PL 论文追踪

全部论文 待读 收藏

P2 What's in a game?

博弈中有什么?
LICS Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science2018匹配度 1/10 · 该论文研究博弈语义的抽象框架与范畴构造,属于纯编程语言形式语义/范畴论方向,与用户关注的静态分析、Agentic/LLM、浮点程序分析、贝叶斯程序分析等核心方向几乎没有交集。引用 5 inbox
Clovis Eberhart, Tom Hirschowitz
crossref: 2026-09-12

AI 速览

一句话:提出统一的博弈语义抽象框架 game settings,并泛型构造博弈与策略范畴,统一早期与层论模型。

博弈语义是程序语言的一类成功指称模型,但其组合结合性等基本性质往往证明困难。本文旨在为博弈语义建立统一抽象框架——game settings。主要贡献是对任意 game setting 泛型构造博弈与策略的范畴,并进一步引入 innocence 概念,证明 innocent strategies 构成子范畴。作者还展示该框架可覆盖许多具体模型,尤其是早期模型与近期基于 sheaf 的模型。

问题
博弈语义中组合结合性等基本结果证明困难,且缺乏统一的抽象框架。
方法
提出 game settings 抽象框架,对任意该框架泛型构造博弈与策略范畴,并扩展到 innocence 以证明其构成子范畴。
评估
通过说明该框架可覆盖早期模型与近期基于 sheaf 的模型等具体案例,验证其统一性与适用性。
原文摘要(Abstract)

Game semantics is a rich and successful class of denotational models for programming languages. Most game models feature a rather intuitive setup, yet surprisingly difficult proofs of such basic results as associativity of composition of strategies. We seek to unify these models into a basic abstract framework for game semantics, game settings. Our main contribution is the generic construction, for any game setting, of a category of games and strategies. Furthermore, we extend the framework to deal with innocence, and prove that innocent strategies form a subcategory. We finally show that our constructions cover many concrete cases, mainly among the early models [5, 23] and the recent, sheaf-based ones [40].

链接与引用

DOI 原文 ·

BibTeX
@inproceedings{paperbot4393,
  title = {What's in a game?},
  author = {Clovis Eberhart and Tom Hirschowitz},
  booktitle = {LICS},
  year = {2018},
  doi = {10.1145/3209108.3209114}
}