English
Related papers

Related papers: Determinacy Maximum

200 papers

We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…

Theoretical Economics · Economics 2021-11-17 Leandro Gorno , Alessandro Rivello

In this paper we define the canonical mixed extension of a decision form game. We motivate the necessity to introduce this concept and we show several examples about the new concept. In particular we focus our study upon the mixed…

Adaptation and Self-Organizing Systems · Physics 2011-03-04 David Carfì , Angela Ricciardello

Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine approximation theory, number theory, and dynamics. Recently, many new results have been proven using this game. In this paper we address…

Logic · Mathematics 2019-02-20 Lior Fishman , Tue Ly , David S. Simmons

We consider a dynamical approach to game in extensive forms. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding…

Computer Science and Game Theory · Computer Science 2017-04-05 Stéphane Le Roux , Arno Pauly

We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.

Logic · Mathematics 2020-01-20 Andrew Marks

We discuss the question of if and how undecidability might be translatable into physics, in particular with respect to prediction and description, as well as to complementarity games.

chao-dyn · Physics 2008-02-03 Karl Svozil

We consider a dynamical approach to sequential games. By restricting the convertibility relation over strategy profiles, we obtain a semi-potential (in the sense of Kukushkin), and we show that in finite games the corresponding restriction…

Computer Science and Game Theory · Computer Science 2016-09-15 Stéphane Le Roux , Arno Pauly

The principle of open determinacy for class games---two-player games of perfect information with plays of length $\omega$, where the moves are chosen from a possibly proper class, such as games on the ordinals---is not provable in…

Logic · Mathematics 2016-07-08 Victoria Gitman , Joel David Hamkins

This paper proposes a new equilibrium concept "robust perfect equilibrium" for non-cooperative games with a continuum of players, incorporating three types of perturbations. Such an equilibrium is shown to exist (in symmetric mixed…

Theoretical Economics · Economics 2021-05-06 Enxian Chen , Lei Qiao , Xiang Sun , Yeneng Sun

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

We show that the higher-order matching problem is decidable using a game-theoretic argument.

Logic in Computer Science · Computer Science 2015-07-01 Colin Stirling

We study finite-memory (FM) determinacy in games on finite graphs, a central question for applications in controller synthesis, as FM strategies correspond to implementable controllers. We establish general conditions under which FM…

Computer Science and Game Theory · Computer Science 2018-10-08 Stéphane Le Roux , Arno Pauly , Mickael Randour

We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's…

Computer Science and Game Theory · Computer Science 2007-06-08 Krzysztof R. Apt

This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention…

Computer Science and Game Theory · Computer Science 2013-09-09 Yang Liu

We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…

Artificial Intelligence · Computer Science 2016-05-31 Paolo Turrini

We introduce the notions of weakly *-concave and weakly naturally quasi-concave correspondence and prove fixed point theorems and continuous selection theorems for these kind of correspondences. As applications in the game theory, by using…

Optimization and Control · Mathematics 2013-03-29 Monica Patriche

This paper examines games with strategic complements or substitutes and incomplete information, where players are uncertain about the opponents' parameters. We assume that the players' beliefs about the opponent's parameters are selected…

Theoretical Economics · Economics 2025-01-28 Joep van Sloun

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

An agent, or a coalition of agents, faces an ethical dilemma between several statements if she is forced to make a conscious choice between which of these statements will be true. This paper proposes to capture ethical dilemmas as a…

Artificial Intelligence · Computer Science 2021-03-03 Pavel Naumov , Rui-Jie Yew

Game Theory concepts have been successfully applied in a wide variety of domains over the past decade. Sports and games are one of the popular areas of game theory application owing to its merits and benefits in solving complex scenarios.…

Computer Science and Game Theory · Computer Science 2021-05-26 Ambareesh Ravi , Atharva Gokhale , Anchit Nagwekar
‹ Prev 1 2 3 10 Next ›