Results 31 to 40 of about 28,094 (268)

TSO Games -- On the decidability of safety games under the total store order semantics (extended LMCS version with appendix) [PDF]

Logical Methods in Computer Science
We consider an extension of the classical Total Store Order (TSO) semantics by expanding it to turn-based 2-player safety games. During her turn, a player can select any of the communicating processes and perform its next transition.
Stephan Spengler, Sanchari Sil
doaj   +1 more source

Game theory of mind [PDF]

, 2008
This paper introduces a model of ‘theory of mind’, namely, how we represent the intentions and goals of others to optimise our mutual interactions. We draw on ideas from optimum control and game theory to provide a ‘game theory of mind’.
Friston, K., Dolan, RJ, Friston, KJ, Karl J. Friston, Dolan, R. ; https://orcid.org/, Wako Yoshida, Ray J Dolan, Dolan, R.J., Yoshida, W., Yoshida, W, Karl J Friston, Behrens, T., Ray J. Dolan, Friston, K.J., Yoshida Wako, Dolan Ray J., Friston Karl J.   +16 more
core   +2 more sources

Algorithmic Game Theory and Blockchains (Invited Talk)

, 2023
Algorithmic game theory has developed into a mature field over the past three decades. However, the emergence of blockchains has raised new fundamental questions at the intersection of computer science, economics, and game ...
Koutsoupias, Elias
core   +1 more source

Playing Safe, Ten Years Later [PDF]

Logical Methods in Computer Science
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is given by the size
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn   +2 more
doaj   +1 more source

Controlling a random population [PDF]

Logical Methods in Computer Science, 2021
Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a target
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann   +2 more
doaj   +1 more source

A Game of Pawns [PDF]

Logical Methods in Computer Science
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location ...
Guy Avni, Pranav Ghorpade, Shibashis Guha   +2 more
doaj   +1 more source

Taking-and-merging games as rewrite games [PDF]

Discrete Mathematics & Theoretical Computer Science, 2020
This work is a contribution to the study of rewrite games. Positions are finite words, and the possible moves are defined by a finite number of local rewriting rules.
Eric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo   +3 more
doaj   +1 more source

Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems [PDF]

Logical Methods in Computer Science
Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in computer science due to their ability to represent a wide range of real-world scenarios involving strategic ...
Senthil Rajasekaran, Moshe Y. Vardi
doaj   +1 more source

Distributed Asynchronous Games With Causal Memory are Undecidable [PDF]

Logical Methods in Computer Science, 2022
We show the undecidability of the distributed control problem when the plant is an asynchronous automaton, the controllers use causal memory and the goal of the controllers is to put each process in a local accepting state.
Hugo Gimbert
doaj   +1 more source

Decidability of higher-order matching [PDF]

Logical Methods in Computer Science, 2009
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj   +1 more source