Výsledky vyhledávání - "Computer Science - Computer Science and Game Theory"

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

Získat plný text

Existence of EFX for two additive valuations Autor Mahara, Ryoga

Získat plný text

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

Získat plný text

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

Získat plný text

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

Získat plný text

Half-Positional Objectives Recognized by Deterministic B\"uchi Automata Autor 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…”
Získat plný text

TSO Games -- On the decidability of safety games under the total store order semantics Autor 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…”
Získat plný text

Good-for-games $\omega$-Pushdown Automata Autor 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…”
Získat plný text

A theory of Automated Market Makers in DeFi Autor 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…”
Získat plný text

With a little help from your friends: semi-cooperative games via Joker moves Autor 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…”
Získat plný text

Games Where You Can Play Optimally with Arena-Independent Finite Memory Autor 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…”
Získat plný text

A Recursive Approach to Solving Parity Games in Quasipolynomial Time Autor 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…”
Získat plný text

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

Získat plný text

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

Získat plný text

Characterizing Positionality in Games of Infinite Duration over Infinite Graphs Autor 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…”
Získat plný text

Stochastic Window Mean-Payoff Games Autor 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…”
Získat plný text

A Game of Pawns Autor 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…”
Získat plný text

The Theory of Universal Graphs for Infinite Duration Games Autor 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…”
Získat plný text

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy Autor 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…”
Získat plný text

Playing Safe, Ten Years Later Autor 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…”
Získat plný text