𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The game of “N questions” on a tree

✍ Scribed by Ronald L. Rivest

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
330 KB
Volume
17
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on Steiner tree games
A note on Steiner tree games
✍ Darko Skorin-Kapov; Jadranka Skorin-Kapov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB
The Variance of Two Game Tree Algorithms
The Variance of Two Game Tree Algorithms
✍ Yanjun Zhang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 210 KB

This article studies the variance of two game tree algorithms, ␣-␤ search and SCOUT, in the stochastic i.i.d. model. The problem of determining the variance of the classic ␣-␤ search algorithm in the i.i.d. model was long open. This article resolves this problem partially. It is shown, by the martin

On cost allocation for a spanning tree:
On cost allocation for a spanning tree: A game theoretic approach
✍ C. G. Bird 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

## Abstract Cooperative game theory solution concepts are used to allocate costs in a spanning tree network. Stable cost allocations are related to the core of a cooperative game and it is proved that every game generated from a minimum cost spanning tree with an immovable source has a core. A refi

A Hamiltonian game on Kn,n
A Hamiltonian game on Kn,n
✍ Xiaoyun Lu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Let K,,, be the complete bipartite graph of order 2n. Two players, maker and breaker, alternately take previously untaken edges of K,.,, one edge per move, with the breaker going first. The game ends when all edges of K,,, have been taken. Then the edges taken by the maker induce a graph G. The make