Learning to bid in bridge

@article{Amit2006LearningTB,
  title={Learning to bid in bridge},
  author={Asaf Amit and Shaul Markovitch},
  journal={Machine Learning},
  year={2006},
  volume={63},
  pages={287-327}
}
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In addition, the partial observability of the game makes it impossible to predict the outcome of each action. In this paper we present a new decision-making algorithm that is capable of overcoming these problems. The algorithm allows models to be used for both opponent agents and partners, while utilizing a novel model-based… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 49 references

Cooperation and competition of agents in the auction

  • T. Ando, N. Kobayashi, T Uehara.
  • 2003
Highly Influential
5 Excerpts

A program to play contract bridge

  • G. pp. 2281–2286. Carley
  • Master’s thesis, Dept. of Electrical Engineering,
  • 1962
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…