Suchergebnisse - "Computer Science - Computer Science and Game Theory"

A Secure and Intelligent Data Sharing Scheme for UAV-Assisted Disaster Rescue von Yuntao Wang, Zhou Su, Qichao Xu, Ruidong Li, Tom H. Luan, Pinghui Wang

Volltext

Existence of EFX for two additive valuations von Mahara, Ryoga

Volltext

SEAL: A Strategy-Proof and Privacy-Preserving UAV Computation Offloading Framework von Yuntao Wang, Zhou Su, Tom H. Luan, Jiliang Li, Qichao Xu, Ruidong Li

Volltext

Class fairness in online matching von Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi, Nisarg Shah

Volltext

On the implementation of zero-determinant strategies in repeated games von Masahiko Ueda

Volltext

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata von Bouyer, Patricia, Casares, Antonio, Randour, Mickael, Vandenhove, Pierre

“… In two-player games on graphs, the simplest possible strategies are those that can be implemented without any memory. These are called positional strategies …”
Volltext

TSO Games -- On the decidability of safety games under the total store order semantics von Spengler, Stephan, Sil, Sanchari

“… 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 …”
Volltext

Good-for-games $\omega$-Pushdown Automata von Lehtinen, Karoliina, Zimmermann, Martin

“… We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed …”
Volltext

A theory of Automated Market Makers in DeFi von Bartoletti, Massimo, Chiang, James Hsin-yu, Lluch-Lafuente, Alberto

“… Automated market makers (AMMs) are one of the most prominent decentralized finance (DeFi) applications. AMMs allow users to trade different types of …”
Volltext

With a little help from your friends: semi-cooperative games via Joker moves von Bos, Petra van den, Stoelinga, Marielle

“… This paper coins the notion of Joker games, a variant of concurrent games where the players are not strictly adversarial. Instead, Player 1 can get help from …”
Volltext

Games Where You Can Play Optimally with Arena-Independent Finite Memory von Bouyer, Patricia, Roux, Stéphane Le, Oualhadj, Youssouf, Randour, Mickael, Vandenhove, Pierre

“… For decades, two-player (antagonistic) games on graphs have been a framework of choice for many important problems in theoretical computer science. A notorious …”
Volltext

A Recursive Approach to Solving Parity Games in Quasipolynomial Time von Lehtinen, Karoliina, Parys, Paweł, Schewe, Sven, Wojtczak, Dominik

“… Zielonka's classic recursive algorithm for solving parity games is perhaps the simplest among the many existing parity game algorithms. However, its complexity …”
Volltext

Popularity on the Roommate Diversity Problem von Steven Ge, Toshiya Itoh

Volltext

Collaborative Honeypot Defense in UAV Networks: A Learning-Based Game Approach von Yuntao Wang, Zhou Su, Abderrahim Benslimane, Qichao Xu, Minghui Dai, Ruidong Li

Volltext

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs von Ohlmann, Pierre

“… We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as …”
Volltext

Stochastic Window Mean-Payoff Games von Doyen, Laurent, Gaba, Pranshu, Guha, Shibashis

“… Stochastic two-player games model systems with an environment that is both adversarial and stochastic. The adversarial part of the environment is modeled by a …”
Volltext

A Game of Pawns von Avni, Guy, Ghorpade, Pranav, Guha, Shibashis

“… 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 …”
Volltext

The Theory of Universal Graphs for Infinite Duration Games von Colcombet, Thomas, Fijalkow, Nathanaël, Gawrychowski, Paweł, Ohlmann, Pierre

“… We introduce the notion of universal graphs as a tool for constructing algorithms solving games of infinite duration such as parity games and mean payoff …”
Volltext

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy von Bisping, Benjamin, Jansen, David N., Nestmann, Uwe

“… We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language …”
Volltext

Playing Safe, Ten Years Later von Colcombet, Thomas, Fijalkow, Nathanaël, Horn, Florian

“… 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 …”
Volltext