English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 92604/122928 (75%)
Visitors : 26837358      Online Users : 487
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 商學院 > 統計學系 > 期刊論文 >  Item 140.119/61607
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/61607

    Title: A Note on the First Occurrence of Strings
    Authors: 洪英超
    Hung,Ying-Chao;Chen, Robert W.;Zame, Alan;Chen, May-Ru
    Contributors: 統計系
    Date: 2010.01
    Issue Date: 2013-11-11 17:46:02 (UTC+8)
    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.
    Relation: The Electronic Journal of Combinatorics, 17, #N5
    Data Type: article
    Appears in Collections:[統計學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    5.pdf89KbAdobe PDF884View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback