Related papers: Determinacy separations for class games
Hedonic games provide a natural model of coalition formation among self-interested agents. The associated problem of finding stable outcomes in such games has been extensively studied. In this paper, we identify simple conditions on…
We propose a new determinacy hypothesis for transfinite games, use the hypothesis to extend the perfect set theorem, prove relationships between various determinacy hypotheses, expose inconsistent versions of determinacy, and provide a…
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of rationalizability. In the case of dominance the criterion of…
We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore…
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…
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…
Schmidt's game, and other similar intersection games have played an important role in recent years in applications to number theory, dynamics, and Diophantine approximation theory. These games are real games, that is, games in which the…
We study the strength of well-founded ultrafilters on ordinals above choiceless large cardinals and their associated Prikry forcings. Gabriel Goldberg showed that all but boundedly many regular cardinals above a rank Berkeley cardinal carry…
In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…
We consider coalition formation games in which each player has preferences over the other players and his preferences over coalitions are based on the best player ($\mathcal{B}$-/B-hedonic games) or the worst player ($\mathcal{W}$/W-hedonic…
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…
Lower bounds for some explicit decision problems over the complex numbers are given.
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…
Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
Using the relative derived categories, we prove that if an Artin algebra $A$ has a module $T$ with ${\rm inj.dim}T<\infty$ such that $^\perp T$ is finite, then the bounded derived category $D^b({\rm mod}A)$ admits a categorical resolution;…
In this paper, we study the notion of a generically extendible cardinal, which is a generic version of an extendible cardinal. We prove that the generic extendibility of $\omega_1$ or $\omega_2$ has small consistency strength, but that of a…
It is known that the large cardinal strength of the Axiom of Determinacy when enhanced with the hypothesis that all sets of reals are universally Baire is much stronger than the Axiom of Determinacy itself. Sargsyan conjectured it to be as…
We consider a class of coalition formation games called hedonic games, i.e., games in which the utility of a player is completely determined by the coalition that the player belongs to. We first define the class of subset-additive hedonic…
We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…