✦ LIBER ✦

A characterization of the average tree solution for tree games

✍ Scribed by Debasis Mishra; A. J. J. Talman

Publisher: Springer-Verlag
Year: 2009
Tongue: English
Weight: 118 KB
Volume: 39
Category: Article
ISSN: 0020-7276
DOI: 10.1007/s00182-009-0194-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average tree solutions and the distribut

Average tree solutions and the distribution of Harsanyi dividends

✍ Richard Baron; Sylvain Béal; Eric Rémila; Philippe Solal 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 301 KB

The game of “N questions” on a tree

✍ Ronald L. Rivest 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Characterization of a Branch of the Phyl

Characterization of a Branch of the Phylogenetic Tree

✍ STUART A. SAMUEL; GEZHI WENG 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a "tortoise and hare effect": those genera with the sm

Another characterization of the centroid

Another characterization of the centroid of a tree

✍ Sandra L. Mitchell 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 478 KB

On the average number of nodes in a subt

On the average number of nodes in a subtree of a tree

✍ Robert E Jamison 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 844 KB

The average height of a node in the BANG

The average height of a node in the BANG abstract directory tree

✍ Stephen Taylor; Nabil Hachem; Stanley Selkow 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 467 KB

The abstract logical data structure for the BANG file directory is a multiway tree structure with one node for each bucket in the file. Under assumptions of "perfect hashing" or "growth on data principle", we model the growth of the tree. The average cost for search and insertion is found to be loga