Playing to Learn, or to Keep Secret: Alternating-Time Logic Meets Information Theory
share
Many important properties of multi-agent systems refer to the participants' ability to achieve a given goal, or to prevent the system from an undesirable event. Among intelligent agents, the goals are often of epistemic nature, i.e., concern the ability to obtain knowledge about an important fact ϕ. Such properties can be e.g. expressed in ATLK, that is, alternating-time temporal logic ATL extended with epistemic operators. In many realistic scenarios, however, players do not need to fully learn the truth value of ϕ. They may be almost as well off by gaining some knowledge; in other words, by reducing their uncertainty about ϕ. Similarly, in order to keep ϕsecret, it is often insufficient that the intruder never fully learns its truth value. Instead, one needs to require that his uncertainty about ϕnever drops below a reasonable threshold. With this motivation in mind, we introduce the logic ATLH, extending ATL with quantitative modalities based on the Hartley measure of uncertainty. The new logic enables to specify agents' abilities w.r.t. the uncertainty of a given player about a given set of statements. It turns out that ATLH has the same expressivity and model checking complexity as ATLK. However, the new logic is exponentially more succinct than ATLK, which is the main technical result of this paper.
READ FULL TEXT