相关论文: The consistency strength of long projective determ…
This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…
Strongly Turing determinacy, or $\mathrm{sTD}$, says that for any set $A$ of reals, if $\forall x\exists y\geq_T x (y\in A)$, then there is a pointed set $P\subseteq A$. We prove the following consequences of Turing determinacy…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…
We extend the Fundamental Theorem of Epistemic Game Theory to games with Baire class one payoffs and locally compact Polish strategy spaces, and under Projective Determinacy, to games with analytically measurable payoffs and arbitrary…
We extend the applications of the techniques used in Arch Math Logic 52:261-278, 2013, to present various examples of consistency results where some cardinal invariants of the continuum take arbitrary regular values with the size of the…
We construct here an iterative evaluation of all PR map codes: progress of this iteration is measured by descending complexity within "Ordinal" O := N[\omega] of polynomials in one indeterminate, ordered lexicographically. Non-infinit…
In this expository note, we give a simple proof that a gambler repeating a game with positive expected value never goes broke with a positive probability. This does not immediately follow from the strong law of large numbers or other basic…
Evolutionary game theory is a powerful mathematical framework to study how intelligent individuals adjust their strategies in collective interactions. It has been widely believed that it is impossible to unilaterally control players'…
We give Woodin's original proof that if there exists a $(\kappa+2)-$strong cardinal $\kappa,$ then there is a generic extension of the universe in which $\kappa=\aleph_\omega,$ $GCH$ holds below $\aleph_\omega$ and…
Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…
A recent result of Moshkovitz \cite{Moshkovitz14} presented an ingenious method to provide a completely elementary proof of the Parallel Repetition Theorem for certain projection games via a construction called fortification. However, the…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
We consider discrete-time uncertain processes with finite state space and study the properties of game-theoretic upper expectations developed by Shafer and Vovk. We start by proving some basic properties, e.g. monotonicity, law of iterated…
In the paper, we establish Squash Rigidity Theorem - the dynamical spectral rigidity for piecewise analytic Bunimovich squash-type stadia. We also establish Stadium Rigidity Theorem - the dynamical spectral rigidity for piecewise analytic…
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…
This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…
We initiate a systematic investigation of the abstract elementary classes that have amalgamation, satisfy tameness (a locality property for orbital types), and are stable (in terms of the number of orbital types) in some cardinal. Assuming…
Consider a two-player game repeated N times. Player 1 can choose between two styles (for interpretability, offensive and defensive), whereas Player 2 uses a single fixed style. Let X N\,:= \#wins -\#losses for Player 1 after N games, and…
We propose a learning dynamics to model how strategic agents repeatedly play a continuous game while relying on an information platform to learn an unknown payoff-relevant parameter. In each time step, the platform updates a belief estimate…
We study the existence of classical solutions to a broad class of local, first order, forward-backward Extended Mean Field Games systems, that includes standard Mean Field Games, Mean Field Games with congestion, and mean field type control…