Search arXivSearch

arXiv subjects

Moutushi Chatterjee

Publications and source records attributed to Moutushi Chatterjee.

3 recordsLinked to original sources

A Statistical Analysis of Three Player Auction Bridge

Three-player Auction Bridge is a finite imperfect-information game in which dynamic partnerships create a distinctive interaction between scoring, strategic incentives, and payoff distribution. This paper develops a unified statistical and game-theoretic framework to evaluate a traditional scoring rule against a modified mechanism designed to improve strategic incentives. We first identify a structural defect in the original scheme: a bid-invariant slam bonus can make lower contracts strictly more attractive than higher ones. A bid-dependent correction removes this incentive distortion. We then compare the two schemes using higher-moment analysis, fairness measures, Nash equilibrium analysis, and General-Sum Counterfactual Regret Minimization (GS-CFR). The results show significant differences in the shape of the payoff distributions and reveal that, although both schemes remain highly balanced across physical seats, the modified scheme substantially increases inequality across strategic roles. The game is shown to be neither zero-sum nor constant-sum, motivating a general-sum rather than minimax analysis. Full-game GS-CFR further indicates a substantial increase in the bidder's payoff under the modified scheme, accompanied by a reduction in defender payoff and a shift from separating to partially pooling bidding behavior. These findings demonstrate that scoring-rule design can fundamentally reshape incentives, payoff distribution, and information transmission in imperfect-information games. The proposed framework provides a systematic approach to evaluating such mechanisms from both statistical and strategic perspectives.

cs.GT

3 Players Auction Bridge - Statistical Algorithmic Strategies

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.

cs.GT

A New Three-Players Auction Bridge with Dynamic Opponents and Team Members

This article presents a new three-player version of the bridge playing card game for the purpose of ending fixed partnerships so that the play can be more dynamic and flexible. By dynamically redefining team makeup in real time, this game design increases unpredictability and forces players to repeatedly update strategy. A novel scoring system is introduced to reduce biases present in conventional rule-based games by favoring fairness via reward systems that enforce tactical decision making and risk assessment. Being subject to regular bridge rules, this version tests players to collaborate without fixed friendships, requiring fluid adjustment and adaptive bidding behavior in real time. Strategic issues involve aggressive and defensive bidding, adaptable playing styles, and loss-seeking strategies specific to the three-player structure. The article discusses probabilistic issues of bidding, trump and no-trump declarative effects, and algorithmic methods to trick-taking. Simulation outcomes illustrate the efficiency of diverse strategies. The game's architecture is ideal for competitions and possibly influential in broadening entry pools for tournament card games.

cs.GT