Related papers: Aspects of Muchnik's paradox in restricted betting
The dominant theories of rational choice assume logical omniscience. That is, they assume that when facing a decision problem, an agent can perform all relevant computations and determine the truth value of all relevant logical/mathematical…
We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…
We analyze cooperative Cournot games with boundedly rational firms. Due to cogni- tive constraints, the members of a coalition cannot accurately predict the coalitional structure of the non-members. Thus, they compute their value using…
We establish the first hardness results for the problem of computing the value of one-round games played by a verifier and a team of provers who can share quantum entanglement. In particular, we show that it is NP-hard to approximate within…
It is well known due to Jarnik that the set Bad of badly approximable numbers is of Hausdorff-dimension one. If Bad(c) denotes the subset of x in Bad for which the approximation constant c > c(x), then Jarnik was in fact more precise and…
This paper presents a new exponential lower bound for the two most popular deterministic variants of the strategy improvement algorithms for solving parity, mean payoff, discounted payoff and simple stochastic games. The first variant…
Tournaments are a widely used mechanism to rank alternatives in a noisy environment. This paper investigates a fundamental issue of economics in tournament design: what is the best usage of limited resources, that is, how should the…
We study the limiting behavior of the mixed strategies that result from optimal no-regret learning strategies in a repeated game setting where the stage game is any 2 by 2 competitive game. We consider optimal no-regret algorithms that are…
Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…
The McNaughton-Zielonka divide et impera algorithm is the simplest and most flexible approach available in the literature for determining the winner in a parity game. Despite its theoretical worst-case complexity and the negative reputation…
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'…
This is a survey article in algebraic logic, where we take a magical tour from old concepts due to Henkin, Monk and Tarski like neat embeddings, to modern views and perspectives, culminating in the use of Erdos graphs in settling important…
We introduce and study Minkowski games. These are two player games, where the players take turns to chose positions in $\mathbb{R}^d$ based on some rules. Variants include boundedness games, where one player wants to keep the positions…
We show that the set of numbers that are $Q$-distribution normal but not simply $Q$-ratio normal has full Hausdorff dimension. It is further shown under some conditions that countable intersections of sets of this form still have full…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
We study a fair division problem with indivisible items, namely the computation of maximin share allocations. Given a set of $n$ players, the maximin share of a single player is the best she can guarantee to herself, if she would partition…
Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight.…
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls…
A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…
We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition structure and probability. The value of a strategy is the…