| dc.contributor | 統計系 | en_US |
| dc.creator (作者) | 洪英超 | zh_TW |
| dc.creator (作者) | Hung,Ying-Chao ; Chen, Robert W. ; Zame, Alan ; Chen, May-Ru | - |
| dc.date (日期) | 2010.01 | en_US |
| dc.date.accessioned | 11-十一月-2013 17:46:02 (UTC+8) | - |
| dc.date.available | 11-十一月-2013 17:46:02 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-十一月-2013 17:46:02 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/61607 | - |
| dc.description.abstract (摘要) | 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 choosing the pair of strings 11 ... 10 and 00 ... 01. We call these two strings “complement strings”, since each bit of one string is the complement bit of the corresponding bit of the other string. In this note, we further study the property of complement strings for three-person games. We prove that if the string length is greater than five and two players choose any pair of complement strings (except for the pair 11 ... 10 and 00 ... 01), then the third player can always attain an advantage by choosing a particular string. | en_US |
| dc.format.extent | 91588 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | The Electronic Journal of Combinatorics, 17, #N5 | en_US |
| dc.title (題名) | A Note on the First Occurrence of Strings | en_US |
| dc.type (資料類型) | article | en |
