English
Related papers

Related papers: Strategies Resilient to Delay: Games under Delayed…

200 papers

We introduce games with probabilistic uncertainty, a natural model for controller synthesis in which the controller observes the state of the system through imprecise sensors that provide correct information about the current state with a…

Computer Science and Game Theory · Computer Science 2012-07-03 Krishnendu Chatterjee , Martin Chmelik , Rupak Majumdar

We study delay-independent stability in nonlinear models with a distributed delay which have a positive equilibrium. Such models frequently occur in population dynamics and other applications. In particular, we construct a relevant…

Dynamical Systems · Mathematics 2009-01-12 Elena Braverman , Sergey Zhukovskiy

We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-01-08 Holger Hermanns , Jan Krčál , Steen Vester

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates…

Computer Science and Game Theory · Computer Science 2017-02-22 Nicolas Basset , Gilles Geeraerts , Jean-François Raskin , Ocan Sankur

Zero-determinant strategies are a class of strategies in repeated games which unilaterally control payoffs. Zero-determinant strategies have attracted much attention in studies of social dilemma, particularly in the context of evolution of…

Statistical Mechanics · Physics 2024-11-11 Masahiko Ueda

Real-world processes often exhibit temporal separation between actions and reactions - a characteristic frequently ignored in many modelling frameworks. Adding temporal aspects, like time delays, introduces a higher complexity of problems…

Populations and Evolution · Quantitative Biology 2025-02-04 Małgorzata Fic , Frank Bastian , Jacek Miękisz , Chaitanya S. Gokhale

This article deals with classes of antagonistic games with two players. A game is specified in terms of two `hostile' stochastic processes representing mutual attacks upon random times exerting casualties of random magnitudes. The game ends…

Probability · Mathematics 2019-01-23 J. H. Dshalalow , K. Iwezulu , R. T. White

This article introduces differential hybrid games, which combine differential games with hybrid games. In both kinds of games, two players interact with continuous dynamics. The difference is that hybrid games also provide all the features…

Logic in Computer Science · Computer Science 2017-08-17 André Platzer

Economic ensembles can be modeled as networks of interacting agents whose be-haviors are described in terms of game theory. The evolutionary paradigm has been applied to two-person games to discover strategies in this context.…

Condensed Matter · Physics 2007-05-23 Wan Ahmad Tajuddin Wan Abdullah

An important class of differential interactive games, namely, one of the laced interactive games is considered. A posteriori analysis of such games (including the virtual a posteriori decomposition of a collective control) is discussed.…

History and Overview · Mathematics 2007-05-23 Denis V. Juriev

We present a general theorem for distributed synthesis problems in coordination games with $\omega$-regular objectives of the form: If there exists a winning strategy for the coalition, then there exists an "essential" winning strategy,…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-27 Dietmar Berwanger , Anup Basil Mathew , R. Ramanujam

In the game-theoretic approach to controller synthesis, we model the interaction between a system to be controlled and its environment as a game between these entities, and we seek an appropriate (e.g., winning or optimal) strategy for the…

Logic in Computer Science · Computer Science 2025-09-05 Mickael Randour

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…

Computational Complexity · Computer Science 2012-02-06 Nathanaël Fijalkow , Florian Horn

Infinitely repeated games support equilibrium concepts beyond those present in one-shot games (e.g., cooperation in the prisoner's dilemma). Nonetheless, repeated games fail to capture our real-world intuition for settings with many…

Computer Science and Game Theory · Computer Science 2025-05-22 Henry Fleischmann , Kiriaki Fragkia , Ratip Emin Berker

We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…

Computer Science and Game Theory · Computer Science 2026-01-13 Sarvin Bahmani , Rasmus Ibsen-Jensen , Soumyajit Paul , Sven Schewe , Friedrich Slivovsky , Qiyi Tang , Dominik Wojtczak , Shufang Zhu

We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown…

Computer Science and Game Theory · Computer Science 2012-10-10 Wladimir Fridman , Martin Zimmermann

Repeated games have a long tradition in the behavioral sciences and evolutionary biology. Recently, strategies were discovered that permit an unprecedented level of control over repeated interactions by enabling a player to unilaterally…

Populations and Evolution · Quantitative Biology 2016-10-25 Alex McAvoy , Christoph Hauert

In this paper we investigate a differential game in which countably many dynamical objects pursue a single one. All the players perform simple motions. The duration of the game is fixed. The controls of a group of pursuers are subject to…

Optimization and Control · Mathematics 2014-10-10 Mehdi Salimi , Gafurjan Ibragimov , Stefan Siegmund , Somayeh Sharifi

We compare two procedures for the iterated removal of strictly dominated strategies. In the nested procedure, a strategy of a player is removed only if it is dominated by an unremoved strategy. The universal procedure is more comprehensive…

Theoretical Economics · Economics 2025-07-09 Michele Crescenzi

Reactive synthesis is a class of methods to construct a provably-correct control system, referred to as a robot, with respect to a temporal logic specification in the presence of a dynamic and uncontrollable environment. This is achieved by…

Formal Languages and Automata Theory · Computer Science 2020-04-24 Abhishek N. Kulkarni , Jie Fu