相关论文: Betting strategies with bounded splits

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…

We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fall into a certain interval may lead to undecidability. In…

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability…

Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…

We study a game where one player selects a random function, and the other has to guess that function, and show that with high probability the second player can correctly guess most of the random function. We apply this analysis to…

We prove an explicit upper bound on the amount of entanglement required by any strategy in a two-player cooperative game with classical questions and quantum answers. Specifically, we show that every strategy for a game with n-bit questions…

In the context of two-player games over graphs, a language $L$ is called positional if, in all games using $L$ as winning objective, the protagonist can play optimally using positional strategies, that is, strategies that do not depend on…

We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the definition of different kind of quantum casinos. The necessity of keeping into account entaglement (by the way we…

We consider a symmetric two-player contest, in which the choice set of effort is constrained. We apply a fundamental property of the payoff function to show that, under standard assumptions, there exists a unique Nash equilibrium in pure…

The principle that rational agents should maximize expected utility or choiceworthiness is intuitively plausible in many ordinary cases of decision-making under uncertainty. But it is less plausible in cases of extreme, low-probability risk…

Can revealing one's competitive capabilities to an opponent offer strategic benefits? In this paper, we address this question in the context of General Lotto games, a class of two-player competitive resource allocation models. We consider…

We consider a class of nonlocal games that are related to binary constraint systems (BCSs) in a manner similar to the games implicit in the work of Mermin [N.D. Mermin, "Simple unified form for the major no-hidden-variables theorems," Phys.…

Let game B be Toral's cooperative Parrondo game with (one-dimensional) spatial dependence, parameterized by N (3 or more) and p_0, p_1, p_2, p_3 in [0,1], and let game A be the special case p_0=p_1=p_2=p_3=1/2. In previous work we…

Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. Recently, such games with quantitative winning conditions in weak MSO with the unbounding…

Usually a voting rule requires agents to give their preferences as linear orders. However, in some cases it is impractical for an agent to give a linear order over all the alternatives. It has been suggested to let agents submit partial…

Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence.…

In this paper we study a continuous time, optimal stochastic investment problem under limited resources in a market with N firms. The investment processes are subject to a time-dependent stochastic constraint. Rather than using a dynamic…

Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…

We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…