#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1972

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Robert W. Chen, Alan Zame, Chien-Tai Lin, Hsiu-fen Wu
- SIAM J. Discrete Math.
- 2005

- Robert W. Chen, Alan Zame, Burton Rosenberg
- Electr. J. Comb.
- 2009

We consider a game in which players select strings over { 0, 1 } and observe a series of fair coin tosses, interpreted as a string over { 0, 1 }. The winner of this game is the player whose string appears first. For two players public knowledge of the opponent's string leads to an advantage. In this paper, results for three players are presented. It is… (More)

- Kenneth Lau, Alan Zame
- Mathematical Systems Theory
- 1972

- Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp
- SIAM J. Discrete Math.
- 1998

- ROBERT CHEN, ALAN ZAME
- 2010

For each integer k i_ 2 9 let {a ns ^} and {b n , k } be two sequences of integers defined by a Uyk = 0 for all n = 1, .. ., k-1, a k} k = 1 s and k for all n >. k; b 1 k = Q 5 and W-l £ w,fc = a n,k + 2 a J,k b n-j,k $ k (t) = E(tN lsk) i f ff(|*|tf 1>fc) < °°; t h e n M«-(DVJ 1-t(iy} *« all-1***1.

- Ying-Chao Hung, Robert W. Chen, Alan Zame, May-Ru Chen
- Electr. J. Comb.
- 2010

We consider the context of a three-person game in which each player selects strings over {0, 1} and observe a series of fair coin tosses. The winner of the game is the player whose selected string appears first. Recently, Chen et al. [4] showed that if the string length is greater and equal to three, two players can collude to attain an advantage by… (More)

- ‹
- 1
- ›