首页> 美国政府科技报告 >On Most Effective Tournament Plans with Fewer Games than Competitors.
【24h】

On Most Effective Tournament Plans with Fewer Games than Competitors.

机译:最有效的比赛计划,比竞争对手更少的比赛。

获取原文

摘要

General random tournament designs are introduced. A tournament plan on a set of players is a rule that generates a sequence of games with the game to be played or termination of the sequence depending only on the outcomes of previous games. In a k.o. plan a player is eliminated from the tournament if he loses a game. The interpretation of tournament plans as mappings with digraphs as domain and range proves to be useful to show the superiority of k.o. plans over other plans with the same fixed number of games in finding the 'best' among n players.

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号