Skip to content

20 sided dice game. Maximize profit. EDA. Jane Street Youtube Channel.

Notifications You must be signed in to change notification settings

ak2k2/Jane-Street-Trading-Mock-Interview

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 

Repository files navigation

Jane Street Mock Interview Question: Python Visualization

This is a project to visualize the optimal strategy to play a betting game with a 20-sided die. The game consists of 100 turns, and every turn the player has two options: to roll the die or to take the money from the casino. The goal is to maximize the player's profit in each game session. Visit the linke below for the entire problem statement.

Reference

Strategies Implemented

  • Scenario 1: Take money or roll the dice, if you take money the dice stays fixed (you can keep the number on the table between rolls).

  • Scenario 2: Take money or roll the dice, if you take money the dice disappears and must be re-rolled next turn.

  • Scenario 3: (Variant of Scenario 1). If you take the $, the casino can choose to reroll the die. The casino aims to minimize your earnings.

  • Gradient Descent to find the optimal player threshold for a given casino threshold.

  • Future Game Theory Exploration

    • Studying the game from an interaction level
    • Analyzing the optimal punishment/reward strategies for each player to maximize their average gains over multiple runs
    • Finding Nash and Stackelberg equilibria regarding the strategic decisions each level of player can make

About

20 sided dice game. Maximize profit. EDA. Jane Street Youtube Channel.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published