English
Related papers

Related papers: Extending Games beyond the Finite Horizon

200 papers

In contrast to the classic formulation of partial monitoring, linear partial monitoring can model infinite outcome spaces, while imposing a linear structure on both the losses and the observations. This setting can be viewed as a…

Machine Learning · Computer Science 2026-01-15 Federico Di Gennaro , Khaled Eldowa , Nicolò Cesa-Bianchi

This dissertation highlights connections between the fields of neural networks, game theory and time series generation. The concept of antipredictability is explained, and the properties of time series that are antipredictable for several…

Disordered Systems and Neural Networks · Physics 2007-05-23 Richard Metzler

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

The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the…

Computational Complexity · Computer Science 2010-11-12 Prasad Raghavendra , David Steurer , Madhur Tulsiani

The maintenance of cooperation in the presence of spatial restrictions has been studied extensively. It is well-established that the underlying graph topology can significantly influence the outcome of games on graphs. Maintenance of…

Physics and Society · Physics 2021-10-27 Saptarshi Sinha , Deep Nath , Soumen Roy

Mean-field games have been studied under the assumption of very large number of players. For such large systems, the basic idea consists to approximate large games by a stylized game model with a continuum of players. The approach has been…

Computer Science and Game Theory · Computer Science 2014-04-08 Hamidou Tembine

Deterministic game-solving algorithms are conventionally analyzed in the light of their average-case complexity against a distribution of random game-trees, where leaf values are independently sampled from a fixed distribution. This…

Artificial Intelligence · Computer Science 2026-02-06 Raphaël Boige , Amine Boumaza , Bruno Scherrer

The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…

Computational Complexity · Computer Science 2020-04-06 Arun U

This paper extends the self-referential framework of Alpay Algebra into a multi-layered semantic game architecture where transfinite fixed-point convergence encompasses hierarchical sub-games at each iteration level. Building upon Alpay…

Computation and Language · Computer Science 2025-07-11 Bugra Kilictas , Faruk Alpay

We consider $N$-player games, in continuous time, finite state space and finite time horizon, on a geometrical structure possessing a macroscopic limit in a suitable sense. This geometrical structure breaks the permutation invariance…

Optimization and Control · Mathematics 2024-10-07 Francesca Albertini , Paolo Dai Pra

Value methods for solving stochastic games with partial observability model the uncertainty about states of the game as a probability distribution over possible states. The dimension of this belief space is the number of states. For many…

Computer Science and Game Theory · Computer Science 2019-03-14 Karel Horák , Branislav Bošanský , Christopher Kiekintveld , Charles Kamhoua

Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with…

Computer Science and Game Theory · Computer Science 2023-06-22 Sven Schewe , Alexander Weinert , Martin Zimmermann

Large language models now write software, draft legal documents, and produce clinical notes, yet fundamental limits, from Turing and Arrow to the No Free Lunch theorems, shape what computation can do. This thesis turns such impossibility…

Artificial Intelligence · Computer Science 2026-05-25 Dongxin Guo

For nearly three decades, spatial games have produced a wealth of insights to the study of behavior and its relation to population structure. However, as different rules and factors are added or altered, the dynamics of spatial models often…

Computer Science and Game Theory · Computer Science 2021-09-30 Jakob Stenseke

In dynamic games with asymmetric information structure, the widely used concept of equilibrium is perfect Bayesian equilibrium (PBE). This is expressed as a strategy and belief pair that simultaneously satisfy sequential rationality and…

Computer Science and Game Theory · Computer Science 2016-09-15 Abhinav Sinha , Achilleas Anastasopoulos

Argumentation is one of the most popular approaches of defining a~non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict…

Artificial Intelligence · Computer Science 2014-04-29 Jozef Frtús

Conventional game theory assumes that players are perfectly rational. In a realistic situation, however, players are rarely perfectly rational. This bounded rationality is one of the main reasons why the predictions of Nash equilibrium in…

Physics and Society · Physics 2026-01-01 Mojtaba Madadi Asl , Mehdi Sadeghi

This paper is concerned with a Stackelberg stochastic differential game on a finite horizon in feedback information pattern. A system of parabolic partial differential equations is obtained at the level of Hamiltonian to give the…

Optimization and Control · Mathematics 2021-08-17 Qi Huang. Jingtao Shi

As increasingly complex AI systems are introduced into our daily lives, it becomes important for such systems to be capable of explaining the rationale for their decisions and allowing users to contest these decisions. A significant hurdle…

Artificial Intelligence · Computer Science 2022-03-22 Sarath Sreedharan , Utkarsh Soni , Mudit Verma , Siddharth Srivastava , Subbarao Kambhampati

Paradox of choice occurs when permitting new strategies to some players yields lower payoffs for all players in the new equilibrium via a sequence of individually rational actions. We consider social network games. In these games the payoff…

Computer Science and Game Theory · Computer Science 2016-09-03 M. Raskin , N. Nikitenkov