We deal with a complex game between Alice and Bob where each contender’s probability of victory grows monotonically by unknown amounts with the resources employed. For a fixed effort on Alice’s part, Bob increases his resources on the basis of the results for each round (victory, tie or defeat) with the aim of reducing the probability of defeat to below a given threshold. We read this goal in terms of computing a confidence interval for the probability of losing and realize that the moves in some contests may bring in an indeterminacy trap: in certain games Bob cannot simultaneously have both a low probability-of-defeat measure and a narrow confidence interval. We use the inferential mechanism called twisting argument to compute the above interval on the basis of two joint statistics. Careful use of such statistics allows us to avoid indeterminacy
Controlling the loasing probability in a monotone game / B. Apolloni, S. Bassis, S.T. Gaito, D. Malchiodi, I. Zoppis. - In: INFORMATION SCIENCES. - ISSN 0020-0255. - 176:10(2006 May), pp. 1395-1416.
Titolo: | Controlling the loasing probability in a monotone game |
Autori: | APOLLONI, BRUNO (Primo) BASSIS, SIMONE (Secondo) MALCHIODI, DARIO (Penultimo) |
Parole Chiave: | Algorithmic inference ; Conflict modeling ; Stochastic games |
Settore Scientifico Disciplinare: | Settore INF/01 - Informatica |
Data di pubblicazione: | mag-2006 |
Rivista: | |
Tipologia: | Article (author) |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1016/j.ins.2005.05.004 |
Appare nelle tipologie: | 01 - Articolo su periodico |