Ulam's game, or the Rényi–Ulam game, is a mathematical game similar to the popular game of twenty questions where one attempts to guess an unnamed… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Ferdinando Cicalese
- Theory of Computing Systems
- 2013

We study a new variant of the classical 20 question game with lies (a.k.a. Ulam-Rényi game). The Ulam-Rényi game models the… (More)

Is this relevant?

2008

2008

- Robert B. Ellis, Vadim Ponomarenko, Catherine H. Yan
- Discrete Mathematics
- 2008

The one-lie Rényi-Ulam liar game is a 2-player perfect information zero sum game, lasting q rounds, on the set [n] := {1… (More)

Is this relevant?

Review

2006

Review

2006

- Elena Kelareva
- 2006

The problem of finding the threshold of a psychometric function is of major interest to researchers in the field of psychophysics… (More)

Is this relevant?

Review

2005

Review

2005

In this paper we discuss some generalizations of Rényi-Ulam game with lies: some of them are simply probabilistic variants of it… (More)

Is this relevant?

2004

2004

- Marcin Peczarski
- ArXiv
- 2004

We present a new approach to construction of protocols which are proof against communication errors. The construction is based on… (More)

Is this relevant?

Review

2004

Review

2004

In this paper we discuss some generalizations of Ulam’s game with lies: some of them are simply probabilistic variants of it… (More)

Is this relevant?

2004

2004

- Robert B. Ellis, Catherine H. Yan
- Int. J. Math. Mathematical Sciences
- 2004

We introduce a dual game to Ulam’s liar game and consider the case of one half-lie. In the original Ulam’s game, Paul attempts to… (More)

Is this relevant?

2000

2000

- Ferdinando Cicalese, Ugo Vaccaro
- Inf. Process. Lett.
- 2000

We consider the problem of searching for an unknown integer in the set {1,2, . . . , n}, by using questions that can be answered… (More)

Is this relevant?

1997

1997

- Daniele Mundici, Alberto Trombetta
- Theor. Comput. Sci.
- 1997

Suppose x is an n-bit integer. By a comparison question we mean a question of the form “does x satisfy either condition a <x< b… (More)

Is this relevant?

1995

1995

- Eugene L. Lawler, Sergei Sarkissian
- Inf. Process. Lett.
- 1995

A near-optimal algorithm for “Ulam’s Game” is presented. The relationship between the game and multiple error correcting codes is… (More)

Is this relevant?