English
Related papers

Related papers: The consistency strength of long projective determ…

200 papers

Evolutionary games on graphs describe how strategic interactions and population structure determine evolutionary success, quantified by the probability that a single mutant takes over a population. Graph structures, compared to the…

Populations and Evolution · Quantitative Biology 2017-05-08 Philipp M. Altrock , Arne Traulsen , Martin A. Nowak

We demonstrate that the technology of Radin forcing can be used to transfer compactness properties at a weakly inaccessible but not strong limit cardinal to a strongly inaccessible cardinal. As an application, relative to the existence of…

Logic · Mathematics 2024-04-29 Tom Benhamou , Jing Zhang

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

Logic · Mathematics 2024-03-15 Andreas Lietz

Finite games in normal form and their mixed extensions are a corner stone of noncooperative game theory. Often generic finite games and their mixed extensions are considered. But the properties which one expects in generic games and the…

Optimization and Control · Mathematics 2024-12-24 Claus Hertling , Matija Vujic

We study strategic interaction in data-driven games where players face uncertainty about payoff distributions inferred from finite samples. To model calibrated attitudes toward such uncertainty, we formulate distributionally robust games…

Computer Science and Game Theory · Computer Science 2026-05-28 Bharat Gangwani , Arunesh Sinha

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

We will consider a number of new large-cardinal properties, the $\alpha$-tremendous cardinals for each limit ordinal $\alpha>0$, the hyper-tremendous cardinals, the $\alpha$-enormous cardinals for each limit ordinal $\alpha>0$, and the…

Logic · Mathematics 2021-03-10 Rupert McCallum

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…

Probability · Mathematics 2010-12-10 Gert de Cooman , Erik Quaeghebeur

The paper is concerned with the dependence of the solution of the deterministic mean field game on the initial distribution of players. The main object of study is the mapping which assigns to the initial time and the initial distribution…

Optimization and Control · Mathematics 2019-02-27 Yurii Averboukh

If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…

Logic · Mathematics 2016-09-07 Ernest Schimmerling , John R. Steel

We prove that the theory of the models constructible using finitely many cofinality quantifiers - $C_{\lambda_{1},...,\lambda_{n}}^{*}$ and $C_{<\lambda_{1},...,<\lambda_{n}}^{*}$ for $\lambda_{1},...,\lambda_{n}$ regular cardinals - is…

Logic · Mathematics 2021-12-03 Ur Ya'ar

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 make use of some observations on the core model, for example assuming $V=L [ E ]$, and that there is no inner model with a Woodin cardinal, and $M$ is an inner model with the same cardinals as $V$, then $V=M$. We conclude in this latter…

Logic · Mathematics 2021-10-27 Jouko Väänänen , Philip Welch

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game…

Logic · Mathematics 2009-09-25 Alan H. Mekler , Saharon Shelah , Jouko Väänänen

Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…

Logic · Mathematics 2021-04-13 Gabriel Fernandes , Ralf Schindler

We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions.

Computer Science and Game Theory · Computer Science 2008-11-26 Nathalie Bertrand , Blaise Genest , Hugo Gimbert

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

We characterize all the pairs of complementary non-homogenous Beatty sequences $(A_n)_{n\ge 0}$ and $(B_n)_{n\ge 0}$ for which there exists an invariant game having exactly $\{(A_n,B_n)\mid n\ge 0\}\cup \{(B_n,A_n)\mid n\ge 0\}$ as set of…

Combinatorics · Mathematics 2013-12-10 Julien Cassaigne , Eric Duchêne , Michel Rigo

Let R be an affine algebra of dimension n \geq 3 over an algebraically closed field k. Suppose char k =0 or char k =p \geq n. Let g,f_1,...,f_r be a R-regular sequence and A=R[f_1/g,...,f_r/g]. Let P be a projective A-module of rank n-1…

Commutative Algebra · Mathematics 2007-05-23 Manoj Kumar Keshari