Les Inscriptions à la Bibliothèque sont ouvertes en
ligne via le site: https://biblio.enp.edu.dz
Les Réinscriptions se font à :
• La Bibliothèque Annexe pour les étudiants en
2ème Année CPST
• La Bibliothèque Centrale pour les étudiants en Spécialités
A partir de cette page vous pouvez :
Retourner au premier écran avec les recherches... |
Détail de l'auteur
Auteur N. Beaumont
Documents disponibles écrits par cet auteur
Affiner la rechercheUsing dynamic programming to determine an optimal strategy in a contract bridge tournament / N. Beaumont in Journal of the operational research society (JORS), Vol. 61 N° 5 (Mai 2010)
[article]
in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 732–739
Titre : Using dynamic programming to determine an optimal strategy in a contract bridge tournament Type de document : texte imprimé Auteurs : N. Beaumont, Auteur Année de publication : 2010 Article en page(s) : pp. 732–739 Note générale : Recherche opérationnelle Langues : Anglais (eng) Mots-clés : Dynamic programming Sports Recreation Optimization Contract bridge Deliberately losing Index. décimale : 001.424 Résumé : One form of contract bridge tournament comprises several rounds of matches in which players compete as pairs for ‘masterpoints’ awarded for each match won or drawn and for being highly placed at the end of the tournament. In the second and subsequent rounds, pairs are matched against other pairs that have been approximately equally successful so far. There has been vague discussion among bridge players of the possible advantages of ‘throwing’, that is, deliberately losing a match in round r so as to obtain a lower ranking and face an easier opponent in round r+1. This paper uses dynamic programming and data from one tournament to identify an optimal strategy (either ‘throw’ or ‘play to win’). The optimal strategy is a function of a pair's ability, its placing after each round, the relative rewards for winning a match and finishing high, the opponent's skill, and the round. For example, we find that a very weak pair should ‘throw’ and ‘play to win’ in alternate rounds. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200941a.html [article] Using dynamic programming to determine an optimal strategy in a contract bridge tournament [texte imprimé] / N. Beaumont, Auteur . - 2010 . - pp. 732–739.
Recherche opérationnelle
Langues : Anglais (eng)
in Journal of the operational research society (JORS) > Vol. 61 N° 5 (Mai 2010) . - pp. 732–739
Mots-clés : Dynamic programming Sports Recreation Optimization Contract bridge Deliberately losing Index. décimale : 001.424 Résumé : One form of contract bridge tournament comprises several rounds of matches in which players compete as pairs for ‘masterpoints’ awarded for each match won or drawn and for being highly placed at the end of the tournament. In the second and subsequent rounds, pairs are matched against other pairs that have been approximately equally successful so far. There has been vague discussion among bridge players of the possible advantages of ‘throwing’, that is, deliberately losing a match in round r so as to obtain a lower ranking and face an easier opponent in round r+1. This paper uses dynamic programming and data from one tournament to identify an optimal strategy (either ‘throw’ or ‘play to win’). The optimal strategy is a function of a pair's ability, its placing after each round, the relative rewards for winning a match and finishing high, the opponent's skill, and the round. For example, we find that a very weak pair should ‘throw’ and ‘play to win’ in alternate rounds. DEWEY : 001.424 ISSN : 0361-5682 En ligne : http://www.palgrave-journals.com/jors/journal/v61/n5/abs/jors200941a.html