Related papers: Increasing the second uniform indiscernible by str…
We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…
We prove that any countable support iteration formed with posets with $\omega_2$-p.i.c.\ has $\omega_2$-c.c., assuming CH in the ground model and assuming also that $\omega_1$ is not collapsed. This improves earlier results of Shelah by…
Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…
For which (first-order complete, usually countable) $T$ do there exist non-isomorphic models of $T$ which become isomorphic after forcing with a forcing notion $\mathbb{P}$? Necessarily, $\mathbb{P}$ is non-trivial; i.e.~it adds some new…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in…
Combinatorial Game Theory has also been called `additive game theory', whenever the analysis involves sums of independent game components. Such {\em disjunctive sums} invoke comparison between games, which allows abstract values to be…
We propose and study a new model for competitions, specifically sports multi-player leagues where the initial strengths of the teams are independent i.i.d. random variables that evolve during different days of the league according to…
Following the ideas laid out in Myerson (1996), Hofbauer (2000) defined a Nash equilibrium of a finite game as sustainable if it can be made the unique Nash equilibrium of a game obtained by deleting/adding a subset of the strategies that…
We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…
We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, ``$\text{ZF}+\text{DC}_{\omega_1}+$all sets of reals are $I_{\mathbb Q,\aleph_0}$-measurable'' implies the existence of an inner model with a measurable…
In this note we prove the uniqueness of solutions to a class of Mean Field Games systems subject to possibly degenerate individual noise. Our results hold true for arbitrary long time horizons and for general non-separable Hamiltonians that…
Selective versions of screenability and of strong screenability coincide in a large class of spaces. We show that the corresponding games are not equivalent in even such standard metric spaces as the closed unit interval. We identify…
We introduce nonlinear attractive effects into a spatial Prisoner's Dilemma game where the players located on a square lattice can either cooperate with their nearest neighbors or defect. In every generation, each player updates its…
We prove that the hydrodynamic pressure $p$ associated to the velocity $u\in C^\theta(\Omega)$, $\theta\in(0,1)$, of an inviscid incompressible fluid in a bounded and simply connected domain $\Omega\subset \mathbb R^d$ with $C^{2+}$…
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
We consider a setting in which a principal gets to choose which game from some given set is played by a group of agents. The principal would like to choose a game that favors one of the players, the social preferences of the players, or the…
We study the computational complexity of finding stable outcomes in hedonic games, which are a class of coalition formation games. We restrict our attention to symmetric additively-separable hedonic games, which are a nontrivial subclass of…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
This is a continuation of "Some results on nonstationry ideal". The upper bound on precipitousness of NS_lambda^+ for a regular lambda given in this paper is proved to be exact.It is shown that saturatedness of NS_kappa^aleph_0 over…