English
Related papers

Related papers: Qualitative Concurrent Stochastic Games with Imper…

200 papers

Two-player graph games have found numerous applications, most notably in the synthesis of reactive systems from temporal specifications, but also in verification. The relevance of infinite-state systems in these areas has lead to…

Logic in Computer Science · Computer Science 2023-11-08 Philippe Heim , Rayna Dimitrova

Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…

Logic in Computer Science · Computer Science 2016-04-18 Vojtěch Forejt , Marta Kwiatkowska , Gethin Norman , Ashutosh Trivedi

Imitating successful behavior is a natural and frequently applied approach to trust in when facing scenarios for which we have little or no experience upon which we can base our decision. In this paper, we consider such behavior in atomic…

Computer Science and Game Theory · Computer Science 2008-10-04 Heiner Ackermann , Petra Berenbrink , Simon Fischer , Martin Hoefer

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

Disordered Systems and Neural Networks · Physics 2009-10-31 Johannes Berg

We study best-response type learning dynamics for zero-sum polymatrix games under two information settings. The two settings are distinguished by the type of information that each player has about the game and their opponents' strategy. The…

Optimization and Control · Mathematics 2025-08-13 Fathima Zarin Faizal , Asuman Ozdaglar , Martin J. Wainwright

Poker is in the family of imperfect information games unlike other games such as chess, connect four, etc which are perfect information game instead. While many perfect information games have been solved, no non-trivial imperfect…

Computer Science and Game Theory · Computer Science 2024-01-15 Prathamesh Sonawane , Arav Chheda

The Type Indeterminacy model is a theoretical framework that formalizes the constructive preference perspective suggested by Kahneman and Tversky. In this paper we explore an extention of the TI-model from simple to strategic…

Physics and Society · Physics 2009-02-11 Jerome Busemeyer , A. Lambert-Mogiliansky

In this article, we focus on search algorithms for two-player perfect information games, whose objective is to determine the best possible strategy, and ideally a winning strategy. Unfortunately, some search algorithms for games in the…

Artificial Intelligence · Computer Science 2026-03-26 Quentin Cohen-Solal

Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…

Computational Complexity · Computer Science 2009-09-25 Erik D. Demaine , Robert A. Hearn

This article studies the value of information in route choice decisions when a fraction of players have access to high accuracy information about traffic incidents relative to others. To model such environments, we introduce a Bayesian…

Computer Science and Game Theory · Computer Science 2016-03-30 Jeffrey Liu , Saurabh Amin , Galina Schwartz

We study countably infinite stochastic 2-player games with reachability objectives. Our results provide a complete picture of the memory requirements of $\varepsilon$-optimal (resp. optimal) strategies. These results depend on the size of…

Computer Science and Game Theory · Computer Science 2024-07-03 Stefan Kiefer , Richard Mayr , Mahsa Shirmohammadi , Patrick Totzke

We present a variant of ATL with distributed knowledge operators based on a synchronous and perfect recall semantics. The coalition modalities in this logic are based on partial observation of the full history, and incorporate a form of…

Logic in Computer Science · Computer Science 2010-08-11 Cătălin Dima , Constantin Enea , Dimitar Guelev

We study a repeated game with payoff externalities and observable actions where two players receive information over time about an underlying payoff-relevant state, and strategically coordinate their actions. Players learn about the true…

Theoretical Economics · Economics 2018-09-05 Pathikrit Basu , Kalyan Chatterjee , Tetsuya Hoshino , Omer Tamuz

Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show that such games admit a value even in the presence of…

Probability · Mathematics 2007-08-21 Ori Gurel-Gurevich

Game-theoretic agents must make plans that optimally gather information about their opponents. These problems are modeled by partially observable stochastic games (POSGs), but planning in fully continuous POSGs is intractable without heavy…

Computer Science and Game Theory · Computer Science 2025-06-03 Mel Krusniak , Hang Xu , Parker Palermo , Forrest Laine

We study stochastic games with energy-parity objectives, which combine quantitative rewards with a qualitative $\omega$-regular condition: The maximizer aims to avoid running out of energy while simultaneously satisfying a parity condition.…

Computer Science and Game Theory · Computer Science 2021-01-19 Richard Mayr , Sven Schewe , Patrick Totzke , Dominik Wojtczak

We present a quantum approach to a signaling game; a special kind of extensive games of incomplete information. Our model is based on quantum schemes for games in strategic form where players perform unitary operators on their own qubits of…

Computer Science and Game Theory · Computer Science 2014-07-28 Piotr Frackiewicz

We study the role of costly information in non-cooperative two-player games when an extrinsic third party information broker is introduced asymmetrically, allowing one player to obtain information about the other player's action. This…

Computer Science and Game Theory · Computer Science 2020-02-20 Matthew J. Young , Andrew Belmonte

Technology development efforts in autonomy and cyber-defense have been evolving independently of each other, over the past decade. In this paper, we report our ongoing effort to integrate these two presently distinct areas into a single…

Computer Science and Game Theory · Computer Science 2020-02-07 Mohamadreza Ahmadi , Arun A. Viswanathan , Michel D. Ingham , Kymie Tan , Aaron D. Ames

Decomposition, i.e. independently analyzing possible subgames, has proven to be an essential principle for effective decision-making in perfect information games. However, in imperfect information games, decomposition has proven to be…

Computer Science and Game Theory · Computer Science 2014-04-22 Neil Burch , Michael Johanson , Michael Bowling
‹ Prev 1 8 9 10 Next ›