Language:  

 BECOME PART OF EUROPEAN RESEARCH IN IST WORLD !
Find:
AddThis Social Bookmark Button
HELP | ABOUT
 
 Query Definition:
 
   
   Selected Dataset:
 
 
 
   Search Method:
  » Basic Search
 
  » Categorical Search
» IST World » Pascal » Publications » 1 Result » Details View
Controlling the losing probability in a monotone game
 
Publication Year: 2005

Type
Unknown Type

 
Authors
Advanced Analysis ...
 
 Results  
 Competence  

Abstract
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.

 
 Project
 
 Results  
   
   
   
   
   

 
 Organisations
 
 Results  
   
   
   
   
   


 
 Related Publications (similar authors)
Advanced Analysis ...
 
 Results  
 Competence  
   
   

 
 Related Publications (similar projects)
Advanced Analysis ...
 
 Results  
 Competence  
   
   

 
 Related Publications (similar organisations)
Advanced Analysis ...
 
 Results  
 Competence  
   
   

 
Datasets 
Pascal
 Analytic Tools:
» Result List
» Details View
 
 Advanced Tools:
» Collaboration Diagram
» Competence Diagram
 
 Experimental Tools: 
» Collaboration Trends
» Competence Trends
» Consortia Prediction
Please send corrections and pointers to missing information to feedback@ist-world.org.