Publication:
A No-Limit Omaha Hi-Lo Poker Jam/Fold Endgame Equilibrium

No Thumbnail Available

Date

2015-10-20

Published Version

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Ho, Kenneth. 2015. A No-Limit Omaha Hi-Lo Poker Jam/Fold Endgame Equilibrium. Master's thesis, Harvard Extension School.

Research Data

Abstract

Omaha Hi-Lo Poker is a variant of the game of Poker, with more possibilities resulting from having four cards per player and a split Hi and Lo pot, compared to Texas Hold’em Poker. Recently published algorithms, commodity cloud computing, and graphics processor acceleration enable the analysis of more complex games. We use the newly published CFR+ algorithm, OpenCL heterogeneous computing framework, and Amazon Web Services cloud computing to analyse Omaha Hi-Lo Poker. Using these tools, an endgame jam/fold e-Nash Equilibrium is found and a scoring heuristic that approximates this equilibrium strategy is constructed.

Description

Other Available Sources

Keywords

Computer Science, Mathematics

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Referenced By

Related Stories