Balancing Game with a Buffer

✍ Scribed by Hua Peng; Catherine Huafei Yan

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 145 KB
• Volume: 21
• Category: Article
• ISSN: 0196-8858
• DOI: 10.1006/aama.1998.0596

✦ Synopsis

We consider a two person perfect information game with a buffer. On each n < < < < round, Player I selects a vector ¨g ‫ޒ‬ with ¨F 1, where и is the l -norm, and 2 Player II can either put the vector in the buffer or choose a sign ⑀ s "1 for a i given vector ¨. There are no more than d vectors that can be put in the buffer. i < < Player II's object is to keep the cumulative sum Ý ⑀ ¨as small as possible. We i i prove that the value of the game goes to infinity if d F n y 2. We give an upper bound of the value if d G n y 1. The same results hold for a generalized problem.