77 citations · 145 across the 23 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
cs.MA2023
Computationally Feasible Strategies
Catalin Dima, Wojciech Jamroga
Real-life agents seldom have unlimited reasoning power. In this paper, we propose and study a new formal notion of computationally bounded strategic ability in multi-agent systems.…
cs.MA2022★ 9 cited
Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol
Francesco Belardinelli, Rodica Condurache, Catalin Dima +2
We propose a notion of alternating bisimulation for strategic abilities under imperfect information. The bisimulation preserves formulas of ATL for both the {\em objective} and…