相关论文: Winning Strategies for the Synchronization Game on…

We construct subgame-perfect equilibria with mixed strategies for symmetric stochastic timing games with arbitrary strategic incentives. The strategies are qualitatively different for local first- or second-mover advantages, which we…

Coordination mechanisms aim to mitigate the impact of selfishness when scheduling jobs to different machines. Such a mechanism defines a scheduling policy within each machine and naturally induces a game among the selfish job owners. The…

We consider zero-sum stochastic games with perfect information and finitely many states and actions. The payoff is computed by a function which associates to each infinite sequence of states and actions a real number. We prove that if the…

Understanding how the interplay between higher-order and multilayer structures of interconnections influences the synchronization behaviors of dynamical systems is a feasible problem of interest, with possible application in essential…

In this paper we briefly report some recent developments on generalized synchronization. We discuss different methods of detecting generalized synchronization. We first consider two unidirectionally coupled systems and then two mutually…

Modern distributed optimization methods mostly rely on traditional synchronous approaches, despite substantial recent progress in asynchronous optimization. We revisit Synchronous SGD and its robust variant, called $m$-Synchronous SGD, and…

We investigate the running sums of some well-known automatic sequences to determine whether they are synchronised.

We consider turn-based stochastic two-player games with a combination of a parity condition that must hold surely, that is in all possible outcomes, and of a parity condition that must hold almost-surely, that is with probability 1. The…

Dynamical systems can be coupled in a manner that is designed to drive the resulting dynamics onto a specified lower dimensional submanifold in the phase space of the combined system. On the submanifold, the variables of the two systems…

In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…

This work is concerned with the design and effects of the synchronization gains on the synchronization problem for a class of networked distributed parameter systems. The networked systems, assumed to be described by the same evolution…

We introduce a new functional element (synchronizer for marked pairs) meant to join results of parallel processing in two-branch fork-join queueing network. Approximations for distribution of sojourn time at the synchronizer are derived…

Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…

Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…

This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to…

This paper introduces a new family of pursuit strategies for multi-pursuer single-evader games in a planar environment. They leverage conditions under which the minimum-time solution of the game becomes equivalent to that of a suitable…

We construct a system of $N$ interacting particles on the unit sphere $S^{d-1}$ in $d$-dimensional space, which has $d$-body interactions only. The equations have a gradient formulation derived from a rotationally-invariant potential of a…

In a network of dynamical systems, concurrent synchronization is a regime where multiple groups of fully synchronized elements coexist. In the brain, concurrent synchronization may occur at several scales, with multiple ``rhythms''…

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…