Guessing and non-guessing of canonical functions

Guessing and non-guessing of canonical functions

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 Games

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

Guessing Handbook

Introduction This package provides functions for discoverying linear recurrence equations with polynomial coefficients satisfied by the entries of a given array. It extends the functionality of existing packages like Mallinger's GeneratingFunctions.m or Salvy and Zimmermann's gfun in two directions: (1) it is more general in that, e.g., multivariate recurrences, or recurrences of a particular s...

Guessing and gambling

Scoring methods in multiple−choice tests are usually designed as fair bets, and thus random guesswork yields zero expected return. This causes the undesired result of forcing risk averse test−takers to pay a premium in the sense of letting unmarked answers for which they have partial but not full knowledge. In this note I use a calibrated model of prospect theory [Tversky and Kahneman (1992, 19...

Guessing with Lies