English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49647/84944 (58%)
Visitors : 7707810      Online Users : 59
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU 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
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/41247


    Title: Constraints for a fair showcase-showdown game
    Authors: 林千代;Lin, Chien-tai;Su, Debby
    Contributors: 淡江大學數學學系
    Keywords: Optimal Stopping Boundary;Optimal Strategy
    Optimal Stopping Boundary;Optimal Strategy
    Date: 2000-12
    Issue Date: 2010-01-28 07:04:18 (UTC+8)
    Publisher: 淡江大學
    Abstract: In a general showcase-showdown game, each of k(k=2 or 3) players in turn spins the wheel once or twice, and then waits for the results of the succeeding players' spin(s). A player whose total score exceeds the limit of the game is immediately eliminated. If there is a tie, then one more spin-off is needed to determine the final winner. Apparently the game is not a fair one even each player plays optimally. In our study we find that some natural constraints can be imposed on the later players in order to have a fair game.
    Relation: International Journal of Information and Management Sciences 11(4), pp.61-80
    Appears in Collections:[數學學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML221View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


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