2 citations · 2 across the 4 of their papers we have counts for
4 papers
Model Checking Strategic Abilities in Information-sharing Systems
Francesco Belardinelli, Ioana Boureanu, Catalin Dima +1
We introduce a subclass of concurrent game structures (CGS) with imperfect information in which agents are endowed with private data-sharing capabilities. Importantly, our CGSs are…
Reasoning about Human-Friendly Strategies in Repeated Keyword Auctions
Francesco Belardinelli, Wojtek Jamroga, Vadim Malvone +3
In online advertising, search engines sell ad placements for keywords continuously through auctions. This problem can be seen as an infinitely repeated game since the auction is ex…
A Hennessy-Milner Theorem for ATL with Imperfect Information
Francesco Belardinelli, Catalin Dima, Vadim Malvone +1
We show that a history-based variant of alternating bisimulation with imperfect information allows it to be related to a variant of Alternating-time Temporal Logic (ATL) with imper…
Model Checking ATL* on vCGS
Francesco Belardinelli, Catalin Dima, Ioana Boureanu +1
We prove that the model checking ATL* on concurrent game structures with propositional control for atom-visibility (vCGS) is undecidable. To do so, we reduce this problem to model…