This paper theoretically and experimentally investigates the behavior of asymmetric players in guessing games. The asymmetry is created by introducing $$r>1$$ replicas one players. Two-player restricted N-player cases are examined detail. Based on model parameters, equilibrium either unique which all choose zero or mixed weak player ( $$r=1$$ ) imitates strong ). A series experiments involving ...

It is possible to control to a large extent, via semiproper forcing, the parameters (β0, β1) measuring the guessing density of the members of any given antichain of stationary subsets of ω1 (assuming the existence of an inaccessible limit of measurable cardinals). Here, given a pair (β0, β1) of ordinals, we will say that a stationary set S ⊆ ω1 has guessing density (β0, β1) if β0 = γ(S) and β1 ...

Guessing, or dictionary, attacks arise when an intruder exploits the fact that certain data like passwords may have low entropy, i.e. stem from a small set of values. In the case of off-line guessing, in particular, the intruder may employ guessed values to analyze the messages he has observed. Previous attempts at formalizing off-line guessing consist of extending a Dolev-Yao-style intruder mo...

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