Promises Made, Promises Kept: Safe Pareto Improvements via Ex Post Verifiable Commitments
Nathaniel Sauerberg, Caspar Oesterheld
摘要
A safe Pareto improvement (SPI) (Oesterheld and Conitzer 2022) is a modification of a game that leaves all players better off with certainty. SPIs are typically proven under qualitative assumptions about the way different games are played. For example, we assume that strictly dominated strategies can be iteratively removed and that isomorphic games are played isomorphically. In this work, we study SPIs achieved through three types of ex post verifiable commitments -promises about player behavior from which deviations can be detected by observing the game. First, we consider disarmament -commitments not to play certain actions. Next, we consider SPIs based on token games. A token game is a game played by simply announcing an action (via cheap talk). As such, its outcome is intrinsically meaningless. However, we assume the players commit in advance to play specific (pure or correlated) strategy profiles in the original game as a function of the token game outcome. Under such commitments, the token game becomes a new, meaningful normal-form game. Finally, we consider default-conditional commitment: SPIs in settings where the players' default ways of playing the original game can be credibly revealed and hence the players can commit to act as a function of this default. We characterize the complexity of deciding whether SPIs exist in all three settings, giving a mixture of characterizations and efficient algorithms and NPand GRAPH ISOMORPHISM-hardness results.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper1
相关 Paper
- CSPI-MT: Calibrated Safe Policy Improvement with Multiple Testing for Threshold PoliciesBrian M. Cho, Ana-Roxana Pop, Kyra Gan, Sam Corbett-Davies 等KDD 2025 · 被引用 2 次
- Commitment to Sparse Strategies in Two-Player GamesSalam Afiouni, Jakub Cerný, Chun Kai Ling, Christian KroerAAAI 2025 · 被引用 1 次
- Modeling Probabilistic Commitments for Maintenance Is Inherently Harder than for AchievementQi Zhang, Edmund H. Durfee, Satinder SinghAAAI 2020 · 被引用 1 次
- Commitment Games with Conditional Information DisclosureAnthony DiGiovanni, Jesse CliftonAAAI 2023 · 被引用 6 次
- Private Bayesian Persuasion with Sequential GamesAndrea Celli, Stefano Coniglio, Nicola GattiAAAI 2020 · 被引用 29 次
