Modeling Probabilistic Commitments for Maintenance Is Inherently Harder than for Achievement
Qi Zhang, Edmund H. Durfee, Satinder Singh
摘要
Most research on probabilistic commitments focuses on commitments to achieve enabling preconditions for other agents. Our work reveals that probabilistic commitments to instead maintain preconditions for others are surprisingly harder to use well than their achievement counterparts, despite strong semantic similarities. We isolate the key difference as being not in how the commitment provider is constrained, but rather in how the commitment recipient can locally use the commitment specification to approximately model the provider's effects on the preconditions of interest. Our theoretic analyses show that we can more tightly bound the potential suboptimality due to approximate modeling for achievement than for maintenance commitments. We empirically evaluate alternative approximate modeling strategies, confirming that probabilistic maintenance commitments are qualitatively more challenging for the recipient to model well, and indicating the need for more detailed specifications that can sacrifice some of the agents' autonomy.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- Maintenance of Social Commitments in Multiagent SystemsPankaj R. Telang, Munindar P. Singh, Neil Yorke-SmithAAAI 2021 · 被引用 6 次
- Reusable Online-Efficient CommitmentsNir Bitansky, Omer Paneth, Dana ShamirCRYPTO 2024 · 被引用 1 次
- Promises Made, Promises Kept: Safe Pareto Improvements via Ex Post Verifiable CommitmentsNathaniel Sauerberg, Caspar OesterheldAAAI 2026 · 被引用 2 次
- A No Free Lunch Theorem for Human-AI CollaborationKenny Peng, Nikhil Garg, Jon M. KleinbergAAAI 2025 · 被引用 8 次
- Interactive Learning from Activity DescriptionKhanh Nguyen, Dipendra Misra, Robert E. Schapire, Miroslav Dudík 等ICML 2021 · 被引用 36 次
