Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/98550
Authors: 
Ethier, Stewart N.
Gámez, Carlos
Year of Publication: 
2013
Citation: 
[Journal:] Games [ISSN:] 2073-4336 [Publisher:] MDPI [Place:] Basel [Volume:] 4 [Year:] 2013 [Issue:] 4 [Pages:] 711-737
Abstract: 
Assuming that cards are dealt with replacement from a single deck and that each of Player and Banker sees the total of his own two-card hand but not its composition, baccara is a 2 . 288 matrix game, which was solved by Kemeny and Snell in 1957. Assuming that cards are dealt without replacement from a d-deck shoe and that Banker sees the composition of his own two-card hand while Player sees only his own total, baccara is a 2 . 2484 matrix game, which was solved by Downton and Lockwood in 1975 for d = 1, 2, . . . , 8. Assuming that cards are dealt without replacement from a d-deck shoe and that each of Player and Banker sees the composition of his own two-card hand, baccara is a 25 . 2484 matrix game, which is solved herein for every positive integer d.
Subjects: 
baccara
chemin de fer
sampling without replacement
matrix game
strict dominance
kernel
solution
Persistent Identifier of the first edition: 
Creative Commons License: 
http://creativecommons.org/licenses/by/3.0/
Document Type: 
Article
Appears in Collections:

Files in This Item:
File
Size
523.02 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.