English
Related papers

Related papers: Regular Games with Imperfect Information Are Not T…

200 papers

We provide an epistemic analysis of arbitrary strategic games based on possibility correspondences. We first establish a generic result that links true common beliefs (and, respectively, common knowledge) of players' rationality defined by…

Computer Science and Game Theory · Computer Science 2008-11-07 Krzysztof R. Apt , Jonathan A. Zvesper

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, this problem is…

Logic in Computer Science · Computer Science 2020-03-11 Raphaël Berthon , Bastien Maubert , Aniello Murano , Sasha Rubin , Moshe Vardi

We propose an extension of Strategy Logic (SL), in which one can both reason about strategizing under imperfect information and about players' knowledge. One original aspect of our approach is that we do not force strategies to be uniform,…

Logic in Computer Science · Computer Science 2019-08-08 Sophia Knight , Bastien Maubert

We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…

Computer Science and Game Theory · Computer Science 2017-04-18 Stefan Kiefer , Richard Mayr , Mahsa Shirmohammadi , Dominik Wojtczak

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

We study the problem of implementing equilibria of complete information games in settings of incomplete information, and address this problem using "recommender mechanisms." A recommender mechanism is one that does not have the power to…

Computer Science and Game Theory · Computer Science 2015-12-11 Michael Kearns , Mallesh M. Pai , Aaron Roth , Jonathan Ullman

In two-player zero-sum stochastic games, where two competing players make decisions under uncertainty, a pair of optimal strategies is traditionally described by Nash equilibrium and computed under the assumption that the players have…

Optimization and Control · Mathematics 2019-07-30 Yagiz Savas , Mohamadreza Ahmadi , Takashi Tanaka , Ufuk Topcu

A fundamental problem with the Nash equilibrium concept is the existence of certain "structurally deficient" equilibria that (i) lack fundamental robustness properties, and (ii) are difficult to analyze. The notion of a "regular" Nash…

Optimization and Control · Mathematics 2019-07-31 Brian Swenson , Ryan Murray , Soummya Kar

In the context of multiplayer games, the parallel repetition problem can be phrased as follows: given a game $G$ with optimal winning probability $1-\alpha$ and its repeated version $G^n$ (in which $n$ games are played together, in…

Quantum Physics · Physics 2025-06-09 Rotem Arnon , Renato Renner , Thomas Vidick

This paper studies two-player zero-sum stochastic Bayesian games where each player has its own dynamic state that is unknown to the other player. Using typical techniques, we provide the recursive formulas and sufficient statistics in both…

Computer Science and Game Theory · Computer Science 2021-05-05 Nabiha Nasir Orpa , Lichun Li

We introduce a game-theoretic framework to study the hypothesis testing problem, in the presence of an adversary aiming at preventing a correct decision. Specifically, the paper considers a scenario in which an analyst has to decide whether…

Information Theory · Computer Science 2013-04-09 Mauro Barni , Benedetta Tondi

Sequential equilibrium is the conventional approach for analyzing multi-stage games of incomplete information. It relies on mutual consistency of beliefs. To relax mutual consistency, I theoretically and experimentally explore the dynamic…

Theoretical Economics · Economics 2023-11-06 Po-Hsuan Lin

In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic games. We propose two ways of doing this, the first way…

Artificial Intelligence · Computer Science 2023-02-10 Quentin Cohen-Solal , Tristan Cazenave

We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a…

Cryptography and Security · Computer Science 2022-05-03 Mário S. Alvim , Konstantinos Chatzikokolakis , Yusuke Kawamoto , Catuscia Palamidessi

Partial-monitoring games constitute a mathematical framework for sequential decision making problems with imperfect feedback: The learner repeatedly chooses an action, opponent responds with an outcome, and then the learner suffers a loss…

Computer Science and Game Theory · Computer Science 2011-10-13 András Antos , Gábor Bartók , Dávid Pál , Csaba Szepesvári

Bayesian rationality in strategic games presumes that it is possible to translate strategic uncertainty into imperfect information. Correlated equilibrium is guided by the idea that players are Bayes rational, have a common prior, and…

Computer Science and Game Theory · Computer Science 2016-02-02 Gabriel Frahm

We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We seek to design strategies for the learner to successfully interact with the opponent. While most previous…

Machine Learning · Computer Science 2020-07-13 Pier Giuseppe Sessa , Ilija Bogunovic , Maryam Kamgarpour , Andreas Krause

Two-player stochastic games are games with two 2 players and a randomised entity called "nature". A natural question to ask in this framework is the existence of strategies that ensure that an event happens with probability 1 (almost-sure…

Computer Science and Game Theory · Computer Science 2018-06-27 Youssouf Oualhadj , Léo Tible , Daniele Varacca

Game theory provides a mathematical framework for analysing strategic situations involving at least two players. Normal-form games model situations where the players simultaneously pick their moves. In this thesis we explore the strategic…

Combinatorics · Mathematics 2019-05-03 Nicholas Ham

We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…

Optimization and Control · Mathematics 2023-11-28 Catherine Rainer , Eilon Solan
‹ Prev 1 3 4 5 6 7 10 Next ›