3 Players Auction Bridge - Statistical Algorithmic Strategies
Sourish Sarkar, Aritrabha Majumdar, Moutushi Chatterjee
Abstract
Three-player auction bridge is an updated version of the worldwide-recognized auction bridge card game. Dynamic partners and opponents are the key factors in this game. This dynamic property reduces the bias and increases the authenticity of this game. The article provides insight on statistical learning and insight for a three-player auction bridge game. An exact algorithm for various scenarios is developed along with the corresponding winning strategies to explore different game plannings and the computational intelligence involved. Based on the algorithm, we simulate data and define the probabilistic values to win a certain game.
Create a lesson
Related papers
On the Role of Tie-Breaking Rules in the Convergence of Fictitious Play for Symmetric First-Price Auctions
Benjamin Heymann
Epsilon-Nash Equilibria in History-Dependent SA-MDPs
Brandon Gary Kaplowitz, Dominik Bohnet Zurcher, Akash Agrawal et al.
Core stability recognition for minimum-cost spanning tree games: Parameterized perspective
Michal Dvořák, Ioannis Kakatelis, Dušan Knop
Second-Best Gains from Trade in Matching Markets
Xiaohui Bei, Bo Li, Wenhao Wu et al.
Equilibria of Round-Robin: Computational Hardness and Fairness for Few Subadditive Agents
Paul W. Goldberg, Alexandros Hollender, Giannis Tyrovolas
Estimate then Predict: Convex Formulation for Travel Demand Forecasting
Youngseo Kim, Gioele Zardini, Samitha Samaranayake et al.