Results 11 to 20 of about 39,034 (275)
Guessing with Distributed Encoders [PDF]
Entropy, 2019 Two correlated sources emit a pair of sequences, each of which is observed by a different encoder. Each encoder produces a rate-limited description of the sequence it observes, and the two descriptions are presented to a guessing device that repeatedly ...
Annina Bracher +2 more
doaj +6 more sources
A Discrete Grüss Type Inequality and Applications for the Moments of Random Variables and Guessing Mappings [PDF]
, 1999 A new discrete Grüss type inequality and applications for the moments of random variables and guessing mappings are ...
Dragomir, Sever S, Diamond, N. T
core +6 more sources
On Some Inequalities for the Moments of Guessing Mapping [PDF]
, 2001 Using some inequalities for real numbers and integrals we point out here some new inequalities for the moments of guessing mapping which generalize and improve the recent results of Arikan [2], Dragomir and van der Hoek [3]-[4] and Dragomir [10]
Pecaric, Josep +2 more
core +6 more sources
On a Grüss-Lupas Type Inequality and its Application for the Estimation of p-Moments of Guessing Mappings [PDF]
, 1999 An inequality of Grüss-Lupas type in normed spaces is proved. Some applications in estimating the p-moments of guessing mapping which complement the recent results of Massey [1], Arikan [2], Boztas [3] and Dragomirvan der Hoek [5]-[7] are also ...
Booth, Geoff L, Dragomir, Sever S
core +6 more sources
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback
The American Mathematical Monthly, 2022 20 pages, minor typos corrected, to appear in the American Mathematical Monthly excluding Section ...
Persi Diaconis +2 more
openaire +2 more sources
The Electronic Journal of Combinatorics, 2001 Suppose we are given some fixed (but unknown) subset $X$ of a set $\Omega$, and our object is to learn as much as possible about the elements of $X$ by asking binary questions. Specifically, each question is just a function $F: \Omega \rightarrow \{0,1\}$, and the answer to $F$ is just the value $F(X_i)$ for some $X_i \in X$, (determined, for example ...
Fan R. K. Chung +2 more
openaire +3 more sources
The American Mathematical Monthly, 2014 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.
Anthony Mendes, Kent E. Morrison
openaire +2 more sources
Optimal guessing in ‘Guess Who’
PLOS ONE, 2021 Are you Richard? Are you Anne? We look at the strategic problem in the children’s guessing game Guess Who, which is a form of zero-sum symmetric game with perfect information. We discuss some preliminary strategic insights and formally derive an optimal strategy and win-probabilities for the game.
openaire +5 more sources
Graph Guessing Games and Non-Shannon Information Inequalities [PDF]
, 2016 Guessing games for directed graphs were introduced by Riis [12] for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see some of the other outcomes depending on the structure of an ...
Vaughan, ER +9 more
core +1 more source
Two Discrete Inequalities of Grüss Type Via Pólya-Szegö and Shisha Results for Real Numbers [PDF]
, 2002 Some new Grüss type discrete inequalities for nonnegative real numbers and applications for the moments of guessing mappings are ...
Dragomir, Sever S, Khan, Lutfar R
core +6 more sources