Cooperation and competition of agents in the auction of computer bridge
暂无分享,去创建一个
The auction in contract bridge is a game with incomplete information. This paper models the process as an interaction among agents with a hypothetical reasoning mechanism. The criterion for the action of each agent is defined as “maximizing gain by cooperating with the partner and minimizing loss by competing with the opponents.” An agent with the following characteristics is created. Based on the course of bidding, the hands of both sides are estimated by hypothetical reasoning. Then flexible bids are made in an effort to obtain the contract with the greatest gain or smallest loss of points. Experiments show that in a game with incomplete information, it is useful not only to send information to the partner, but also to disrupt information exchange by the opponents. The effect of ambiguity of information on the behavior of both sides is discussed. © 2003 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 86(12): 76–86, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.10144
[1] Anthony I. Wasserman,et al. Realization of a skillful bridge bidding program , 1970, AFIPS '70 (Fall).
[2] Dana S. Nau,et al. A PLANNING APPROACH TO DECLARER PLAY IN CONTRACT BRIDGE , 1995, Comput. Intell..
[3] Matthew L. Ginsberg,et al. GIB: Steps Toward an Expert-Level Bridge-Playing Program , 1999, IJCAI.