pith. sign in

arxiv: 1506.03885 · v1 · pith:VJNFJXX3new · submitted 2015-06-12 · 💻 cs.GT

Games with Delays. A Frankenstein Approach

classification 💻 cs.GT
keywords equilibriumsignalsdelaysfrankensteingamegamesidentifymodel
0
0 comments X
read the original abstract

We investigate infinite games on finite graphs where the information flow is perturbed by nondeterministic signalling delays. It is known that such perturbations make synthesis problems virtually unsolvable, in the general case. On the classical model where signals are attached to states, tractable cases are rare and difficult to identify. Here, we propose a model where signals are detached from control states, and we identify a subclass on which equilibrium outcomes can be preserved, even if signals are delivered with a delay that is finitely bounded. To offset the perturbation, our solution procedure combines responses from a collection of virtual plays following an equilibrium strategy in the instant- signalling game to synthesise, in a Frankenstein manner, an equivalent equilibrium strategy for the delayed-signalling game.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.