Hostname: page-component-8678677fb7-h96qj Total loading time: 0 Render date: 2026-10-11T01:00:45.721Z Has data issue: false hasContentIssue false

Nonconstant Sum Red-And-Black Games with Bet-Dependent Win Probability Function

Part of: Game theory

Published online by Cambridge University Press:  14 July 2016

Laura Pontiggia*
Affiliation:
University of the Sciences in Philadelphia
*
∗ Postal address: Department of Mathematics, Physics and Computer Science, University of the Sciences in Philadelphia, 600 South 43rd Street, Philadelphia, PA 19104, USA. Email address: l.pontig@usip.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this paper we investigate a class of N-person nonconstant sum red-and-black games with bet-dependent win probability functions. We assume that N players and a gambling house are engaged in a game played in stages, where the player's probability of winning at each stage is a function f of the ratio of his bet to the sum of all the players' bets. However, at each stage of the game there is a positive probability that all the players lose and the gambling house wins their bets. We prove that if the win probability function is super-additive and it satisfies f(s)f(t)≤f(st), then a bold strategy is optimal for all players.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2007