资源分类
》 资源 》论文》Strategy Logic with Simple Goals: Tractable Reasoning about Strategies

Strategy Logic with Simple Goals: Tractable Reasoning about Strategies

2019-09-26 | |  83 |   33 |   0 0 0
Abstract In this paper we introduce Strategy Logic with Simple Goals (SL[SG]), a fragment of Strategy Logic that strictly extends Alternating-time Temporal Logic ATL by introducing arbitrary quantifi- cation over the agents’ strategies. Our motivation comes from game-theoretic applications, such as expressing Stackelberg equilibria in games, coercion in voting protocols, as well as module checking for simple goals. We prove that model checking SL[SG] is P-complete, the same as ATL. Thus, the extra expressive power comes at no computational cost as far as verification is concerned

上一篇：Strategic Signaling for Selling Information Goods

下一篇：Strategyproof and Approximately Maxmin Fair Share Allocation of Chores

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...