Jatin Jindal

Hall-3 · IIT Kanpur, Kanpur · 208016 · +91-7318019187 jatinj@iitk.ac.in


I am a UG Y-16 Batch student in Computer Science and Engineering Department, IIT Kanpur. My research interests include Game Theory and Mechanism Design. Besides academics, I like to play chess and listen to music.

Research Experience

SURGE(Students-Undergraduate Research and Graduate Excellence Program), IIT Kanpur

Research Project under Swaprava Nath: Assistant Professor in CSE, IIT Kanpur)

  • Developed a Truthful Peer Grading Mechanism in cardinal setting at a constant effort from instructor which gives significant improvement from the existing methods.
  • Paper Under Review: Jatin Jindal and Swaprava Nath,"Truthful Peer Grading with Limited Effort from Teaching Staff” in Web and Internet Economics Conference(WINE), UK.
  • Currently preparing for the Human Subject Experiment for testing our peer grading Model.

May 2018 - July 2018


Game Theory (Reading Project)

(Swaprava Nath: Assistant Professor, Department of CSE, IIT Kanpur)
  1. Fair Allocation of Rooms in Double Sharing:
    • Studied the papers related to Single Room Envy-free Allocation using Suitable Pricing.
    • Understood the analogy of Double Room envy-free allocation with 3D Matching.
    • Studied about the various approximate solutions using different kinds of envy-freeness definition like 2 Persons Stable, 4 Persons Stable, Room swap stable.
  2. AI in Poker: Embedded Artificial Intelligence in a poker game after going through Noam Brown papers like Decomposition into Subgames, Regret Minimization, etc.
  3. AI for Smart Education: Literature review on ordinal peer grading heuristics, rank aggregation techniques like Borda, Copeland, and models like Mallows, Luce, etc.
Dec 2017 - May 2018

Projects

Battleship game

Python and Pygame

To build Battleship Game in python using:

  • Monte Carlo Algorithm- Randomized Algorithm which is used for finding the probability of ship in the grid.
  • Pygame- Library in python to provide graphics, sound and animations to the game.

May 2017 - July 2017


Connect-4 Game

Game Theory

To implement Connect-4 and Tic-Tac-Toe game using:

  • Min-Max Algorithm- An algorithm used in game theory to find the optimal move of player.
  • Alpha Beta Pruning- An algorithm to reduce the number of Min-Max computations.
  • Heuristic functions- This is a function that ranks alternatives in search algorithms at each branching step based on available information resulting in further optimization of code.
  • Jquery- Library used for interaction between server-client.

Jan 2017 - April 2017

Education

Indian Institute of Technology Kanpur

Bachelor of Technology
Computer Science and Engineering

CGPA: 9.9/10.0

July 2016 - present

BOSCO PUBLIC School

Senior Secondary Education

PERCENTAGE: 96.8

April 2014 - May 2016

Interests

Apart from my regular studies, I like to play chess, cricket.

I follow a number of sci-fi and fantasy genre movies and television shows, I spend a large amount of my free time exploring the latest technolgy advancements.

Awards & Certifications