Related papers: Remarks on the tail order on moment sequences
The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…
We consider a family of distributions on which natural tail orders can be constructed upon a representation of a distribution by a (single) hyper-real number. Past research revealed that the ordering can herein strongly depend on the…
For two causal structures with the same set of visible variables, one is said to observationally dominate the other if the set of distributions over the visible variables realizable by the first contains the set of distributions over the…
We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.
This paper integrates two strands of the literature on stability of general state Markov chains: conventional, total variation based results and more recent order-theoretic results. First we introduce a complete metric over Borel…
Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves, and are then informed of each other's moves. Payoff is determined by a Borel measurable function $f$ on the set of possible…
We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our design by representing voting games using a division lattice…
We deal with coalitional games possessing strictly positive values. Individually rational allocations of such a game has clear fractional interpretations. Many concepts, including the long-existing core and other stability notions more…
We investigate the existence of certain types of equilibria (Nash, $\varepsilon$-Nash, subgame perfect, $\varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental…
We prove that every two-player non-zero-sum Borel game with lower-semi-continuous payoffs admits a subgame-perfect $\ep$-equilibrium. This result complements Example 3 in Solan and Vieille (2003), which shows that a subgame-perfect…
Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…
We prove that a probability measure on the real line has a moment of order p (even integer), if and only if its R-transform admits a Taylor expansion with p terms. We also prove a weaker version of this result when p is odd. Then, we apply…
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…
We examine domain-valued maxitive measures defined on the Borel subsets of a topological space. Several characterizations of regularity of maxitive measures are proved, depending on the structure of the topological space. Since every…
We study analytic and Borel subsets defined similarily to the old example of analytic complete set given by Luzin. Luzin's example, which is essentially a subset of the Baire space, is based on the natural partial order on naturals, i.e.…
It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…
Moment closure methods appear in myriad scientific disciplines in the modelling of complex systems. The goal is to achieve a closed form of a large, usually even infinite, set of coupled differential (or difference) equations. Each equation…
The aim of this article is to establish basic results in a conditional measure theory. The results are applied to prove that arbitrary kernels and conditional distributions are represented by measures in a conditional set theory. In…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…