We propose a general semantics for strategic abilities of agents in asynchronous systems,
with and without perfect information. Based on the semantics, we show some general …

Abstract Model checking of strategic ability under imperfect information is known to be hard.
The complexity results range from NP-completeness to undecidability, depending on the …

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 …

We present an experimental tool for verification of strategic abilities under imperfect
information, as well as strategy synthesis. The problem is well known to be hard, both …

S elene is a recently proposed voting protocol that provides reasonable protection against
coercion. In this paper, we make the first step towards a formalization of selected features of …

In game theory, as well as in the semantics of game logics, a strategy can be represented by
any function from states of the game to the agent's actions. That makes sense from the …

Logical systems containing knowledge and know-how modalities have been investigated in
several recent works. Independently, epistemic modal logics in which every knowledge …

As a new type of epistemic logics, the logics of knowing how capture the high-level
epistemic reasoning about the knowledge of various plans to achieve certain goals. Existing …

Most contemporary systems involve social as much as technological aspects, and even
those that focus on technology are often based on autonomous components exhibiting self …

We propose a notion of alternating bisimulation for strategic abilities under imperfect
information. The bisimulation preserves formulas of ATL⁎ for both the objective and …