政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/30928
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文筆數/總筆數 : 113822/144841 (79%)
造訪人次 : 51820680      線上人數 : 532
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋
    政大機構典藏 > 商學院 > 統計學系 > 學位論文 >  Item 140.119/30928


    請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/30928


    題名: 依序選擇四字串使第二字串或第四字串先出現的後選優勢探討
    On the first occurrence of four strings with teams
    作者: 謝松樺
    Hsieh, Sung Hua
    貢獻者: 蔡紋琦
    Tsai, Wen Chi
    謝松樺
    Hsieh, Sung Hua
    關鍵詞: 字串
    等候時間
    馬可夫鏈
    string
    waiting time
    markov chain
    日期: 2008
    上傳時間: 2009-09-14
    摘要: 本論文主要是在探討依序選擇四個字串之下，是否存在一策略使得第二或第四字串有較大的機會比第一或第三字串先出現，也就是所謂的後選優勢是否存在。
    利用電腦計算，我們發現字串長度為4,5,6時後選優勢確實存在，而當字串長度大於等於或等於7時，我們則證明了若第一字串為(0,0,...,0),(0,0,...,0,1),(1,1,...,1)或(1,1,...,1,0)時，後選者優勢亦存在。
    In the thesis, we consider about the first occurrence of four strings decided sequentially with teams. Team 1 consists string 1 and string 3; team 2 consists string 2 and string 4. It is interested in whether or not team 2 whose strings are decided after first string and third string are given separately gets an advantage in appearing with larger probability.Namely, given any string 1, we want to find a string 2 such that any string 3 corresponds to at least one string (string 4) making
    a larger probability for team 2 in appearing earlier than team 1.
    Based on the result from computer calculation, team 2 advantage over team 1 when the string length is 4, 5, and 6. This thesis also shows that team 2 gets an advantage for cases where string 1 is (0,0,...,0), (0,0,...,0,1), (1,1,...,1), (1,1,...,1,0) ,when the string length is
    larger than 6.
    參考文獻: [1]Chen, R. (1989) A circular property of the occurrence of sequence patterns in the fair coin-tossing process, Adv. Appl. Probability,
    Vol.21, pp.938-940.
    [2]Chen, R. and Lin, H.E. (1984) On fair coin toissing process, J.
    Multivariate Anal., Vol15, pp.222-227.
    [3]Chen, R. and Zame, A. (1979) On fair coin-toissing game, J.
    Multivariate Anal., Vol9, pp.150-157.
    [4]Chen, R., Hung, Y.-C., Chen M.-R.and Zame, A.,On the first occurrence of complement strings (unpublished).
    [5]Chen, R., Rosenberg, B. and Zame, A. (1979) On the first occurrence of strings, (unpublished).
    [6]Gerber, H. V. and Li, S.Y.R. (1981) The occurrence of sequence patterns in repeated experiments and hitting times in a Markov chain, Stoch.
    Process and Their Application, Vol.11, pp.101-108.
    [7]Guibs,L. and Odlyko, A. M. (1981) String overlaps, pattern matching, and nontransitive games.,J. Combin. Theory Ser.A, Vol.30, pp.1183-208.
    [8]Li, S. Y. R. (1980) A martingale approach to the study of occurrence of sequence patterns in repeated experiments ,Annals of Probability,
    Vol.8, pp.1171-1176.
    [9]Pozdnyakov, V. (2008) On occurrence of patterns in markov chains: Method of gambling teams, Stat. & Prob. Letters, Vol.78, Pages2559-2838.
    [10]Williams, D. (1991) Probability with Martingales, Cambridge University Press, Cambridge.
    描述: 碩士
    國立政治大學
    統計研究所
    96354018
    97
    資料來源: http://thesis.lib.nccu.edu.tw/record/#G0096354018
    資料類型: thesis
    顯示於類別:[統計學系] 學位論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML2228檢視/開啟


    在政大典藏中所有的資料項目都受到原著作權保護.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋