相关论文: The Kelly Criterion And Utility Function Optimisat…

In an equity market model with "Knightian" uncertainty regarding the relative risk and covariance structure of its assets, we characterize in several ways the highest return relative to the market that can be achieved using nonanticipative…

We show that, in a resource allocation problem, the ex ante aggregate utility of players with cumulative-prospect-theoretic preferences can be increased over deterministic allocations by implementing lotteries. We formulate an optimization…

We model stochastic choice as environment-dependent switching among a small library of deterministic decision rules. A Random Rule Model generates menu-level choice probabilities via named, interpretable rules weighted by observable menu…

We study the stochastic versions of a broad class of combinatorial problems where the weights of the elements in the input dataset are uncertain. The class of problems that we study includes shortest paths, minimum weight spanning trees,…

In this paper, we formulate a qualitative "linear" utility theory for lotteries in which uncertainty is expressed qualitatively using a Spohnian disbelief function. We argue that a rational decision maker facing an uncertain decision…

Given a dynamic ordinal game, we deem a strategy sequentially rational if there exist a Bernoulli utility function and a conditional probability system with respect to which the strategy is a maximizer. We establish a complete class theorem…

We consider a variant of sequential testing by betting where, at each time step, the statistician is presented with multiple data sources (arms) and obtains data by choosing one of the arms. We consider the composite global null hypothesis…

Using game and probability theories, I study the French popular game 421, a perfect information stochastic stage game. The problem is to find strategies maximizing the probability of some expected utility. I only solve a player's round…

In the classical Binary Networked Public Goods (BNPG) game, a player can either invest in a public project or decide not to invest. Based on the decisions of all the players, each player receives a reward as per his/her utility function.…

We introduce the Colonel Blotto game with favoritism, an extension of the famous Colonel Blotto game where the winner-determination rule is generalized to include pre-allocations and asymmetry of the players' resources effectiveness on each…

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

This paper studies a two-person trading game in continuous time that generalizes Garivaltis (2018) to allow for stock prices that both jump and diffuse. Analogous to Bell and Cover (1988) in discrete time, the players start by choosing fair…

The probability Psuccess(alpha, N) that stochastic greedy algorithms successfully solve the random SATisfiability problem is studied as a function of the ratio alpha of constraints per variable and the number N of variables. These…

In an incomplete model, where under an appropriate num\'eraire, the stock price process is driven by a sigma-bounded semimartingale, we investigate the behavior of the expected utility maximization problem under small perturbations of the…

This paper presents a novel approach for optimizing betting strategies in sports gambling by integrating Von Neumann-Morgenstern Expected Utility Theory, deep learning techniques, and advanced formulations of the Kelly Criterion. By…

Given a composite null hypothesis H, test supermartingales are non-negative supermartingales with respect to H with initial value 1. Large values of test supermartingales provide evidence against H. As a result, test supermartingales are an…

Motivated by cost of computation in game theory, we explore how changing the utilities of players (changing their complexity costs) affects the outcome of a game. We show that even if we improve a player's utility in every action profile,…

We provide sufficient conditions under which a utility function may be recovered from a finite choice experiment. Identification, as is commonly understood in decision theory, is not enough. We provide a general recoverability result that…

Recently noticed ability of restart to reduce the expected completion time of first-passage processes allows appealing opportunities for performance improvement in a variety of settings. However, complex stochastic processes often exhibit…

We consider some well-known families of two-player, zero-sum, perfect information games that can be viewed as special cases of Shapley's stochastic games. We show that the following tasks are polynomial time equivalent: - Solving simple…