
In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to the target or a winner can be a player coming closest without guessing higher than the target. We study optimal strategies for players in these games and determine some of them for two, three, and four players.
12 pages, 3 figures
FOS: Computer and information sciences, 91A06 (Primary) 91A60 (Secondary), Computer Science - Computer Science and Game Theory, Probability (math.PR), FOS: Mathematics, Mathematics - Probability, Computer Science and Game Theory (cs.GT)
FOS: Computer and information sciences, 91A06 (Primary) 91A60 (Secondary), Computer Science - Computer Science and Game Theory, Probability (math.PR), FOS: Mathematics, Mathematics - Probability, Computer Science and Game Theory (cs.GT)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
