Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology...
-
Upload
valerie-leonard -
Category
Documents
-
view
214 -
download
0
Transcript of Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology...
![Page 1: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/1.jpg)
Rényi-Ulam liar games with a fixed number of lies
Robert B. EllisIllinois Institute of Technology
University of Illinois at Chicago, October 26, 2005
coauthors:Vadim Ponomarenko, Trinity University
Catherine Yan, Texas A&M
![Page 2: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/2.jpg)
2
Two Vector Games
![Page 3: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/3.jpg)
3
The original liar game
![Page 4: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/4.jpg)
4
Original liar game example
![Page 5: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/5.jpg)
5
Original liar game history
![Page 6: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/6.jpg)
6
Round 1 Round 2 Round 3 Round 4 Round 5
Bet 1 W W W W W
Bet 2 L W W W W
Bet 3 W L W W W
Bet 4 W W L L L
Bet 5 L L W L L
Bet 6 L L L W L
Bet 7 L L L L W
Payoff: a bet with · 1 bad predictionQuestion. Min # bets to guarantee a payoff?
Ans.=7
A football pool
![Page 7: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/7.jpg)
7
Round 1 Round 2 Round 3 Round 4 Round 5
Bet 1 W
Bet 2 W
Bet 3 W
Bet 4 L
Bet 5 L
Bet 6 L
Carole W
Pathological liar game as a football pool
Payoff: a bet with · 1 bad predictionQuestion. Min # bets to guarantee a payoff?
Ans.=6
![Page 8: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/8.jpg)
8
Pathological liar game history
Liar Games Covering Codes
![Page 9: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/9.jpg)
9
Optimal n for Paul’s win
![Page 10: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/10.jpg)
10
Sphere bound for both games
![Page 11: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/11.jpg)
11
Converse to sphere bound: a counterexample
10 6 9 7 7 9
3-weight of possible next states
Y N
![Page 12: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/12.jpg)
12
Perfect balancing is winning
16 (4-weight)
8 (3-weight)
4
2
1
![Page 13: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/13.jpg)
13
A balancing theorem for both games
![Page 14: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/14.jpg)
14
Lower bound for the original game
![Page 15: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/15.jpg)
15
Upper bound for the pathological game
![Page 16: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/16.jpg)
16
Upper bound for the pathological game
![Page 17: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/17.jpg)
17
Summary of game bounds
![Page 18: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/18.jpg)
18
Unified 1 lie strategy
![Page 19: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/19.jpg)
19
Unified 1 lie strategy
![Page 20: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/20.jpg)
20
Round 1 Round 2 Round 3 Round 4 Round 5
Bet 1 W W W
Bet 2 W L W W
Bet 3 W L L L L
Bet 4 L W
Bet 5 L W
Bet 6 L W
Carole W L L L W
Recall: (x,q,1)* game as a football pool
Payoff: a bet with · 1 bad predictionQuestion. Min # bets to guarantee a payoff?
Ans.=6
![Page 21: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/21.jpg)
21
Rou
nd 1
Bets $ adaptive Hamming balls
A “radius 1 bet” with predictions on 5 rounds can pay off in 6 ways:
Root 1 1 0 1 0 All predictions correct
Child 1 0 * * * * 1st prediction incorrect
Child 2 1 0 * * * 2nd prediction incorrect
Child 3 1 1 1 * * 3rd prediction incorrect
Child 4 1 1 0 0 * 4th prediction incorrect
Child 5 1 1 0 1 1 5th prediction incorrect
Rou
nd 2
Rou
nd 3
Rou
nd 4
Rou
nd 5
A fixed choice in {0,1} for each “*” yields an adaptive Hamming ball of radius 1.
![Page 22: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/22.jpg)
22
Strategy tree for adaptive betting
W/1 L/0
W/1 L/0 W/1 L/0
Paths to leaves containing 1:11111 Root (0 incorrect predictions)00101 Child 1 (1 incorrect prediction)10101 Child 2 11001 Child 3 11101 Child 4 11110 Child 5 (1 incorrect prediction)
11011 10111
11100 11010 10110 10011
10100 10010 1000111000
10000
01111
01101 01011 0011101110
01100 01010 01001 00110
11111
1110111110
11001 10101
00101 00011
00100 00010 0000101000
00000
![Page 23: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/23.jpg)
23
Adaptive code reformulation
![Page 24: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/24.jpg)
24
Radius 1 packings within coverings
![Page 25: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/25.jpg)
25
Radius 1 packings within coverings
![Page 26: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/26.jpg)
26
Open directions•Asymmetric Hamming balls and structures for arbitrary communication channels (Spencer, Dumitriu for original game)
•Questions occurring in batches (partly solved for original game)
•Simultaneous packings and coverings for general k
•Passing to k=k(n), such as allowing some fraction of answers to be lies (partly studied by Spencer and Winkler)
•Comparisons to random walks and discrete-balancing processes such as chip-firing and the Propp machine
[email protected] http://math.iit.edu/~rellis/
[email protected] http://www.trinity.edu/~vadim/
[email protected] http://www.math.tamu.edu/~cyan/
Thank you.
(preprints)
![Page 27: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/27.jpg)
27
Lower bound by probabilistic strategy
![Page 28: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/28.jpg)
28
Upper bound: Stage I, x! y’
![Page 29: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/29.jpg)
29
Upper bound: Stages I (con’t) & II
![Page 30: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/30.jpg)
30
Upper bound: Stage III and conclusion
![Page 31: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/31.jpg)
31
Exact result for k=1
![Page 32: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/32.jpg)
32
Exact result for k=2
![Page 33: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/33.jpg)
33
Linear relaxation and a random walkIf Paul is allowed to choose entries of a to be real rather than integer, then a=x/2 makes the weight imbalance 0.
Example: ((n,0,0,0),q,3)*-game and random walk on the integers:
![Page 34: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/34.jpg)
34
Covering code formulation11111
11101 11011 1011111110
11100 11010 11001 10110 10101 10011
10100 10010 1000111000
10000
01111
01101 01011 0011101110
01100 01010 01001 00110 00101 00011
00100 00010 0000101000
00000
W!1, L!0
Equivalent questionWhat is the minimum number of radius 1 Hamming balls needed to cover the hypercube Q5?
1111110111
1100001111
001000001000001
C=
![Page 35: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/35.jpg)
35
Sparse history of covering code density
![Page 36: Rényi-Ulam liar games with a fixed number of lies Robert B. Ellis Illinois Institute of Technology University of Illinois at Chicago, October 26, 2005.](https://reader036.fdocuments.us/reader036/viewer/2022062516/56649d975503460f94a80c4c/html5/thumbnails/36.jpg)
36
Future directions•Efficient Algorithmic implementations of encoding/decoding using adaptive covering codes
•Generalizations of the game to k a function of n
•Generalization to an arbitrary communication channel(Carole has t possible responses, and certain responses eliminate Paul’s vector entirely)
•Pullback of a directed random walk on the integers with weighted transition probabilities
•Generalization of the game to a general weighted, directed graph
•Comparison of game to similar processes such as chip-firing and the Propp machine via discrepancy analysis
[email protected] http://www.math.tamu.edu/~rellis/
[email protected] http://www.trinity.edu/~vadim/
[email protected] http://www.math.tamu.edu/~cyan/