Matthew Katzman

Senior Data Scientist, Boston Consulting Group (BCG X) | PhD (DPhil) Computer Science, University of Oxford

Boston, Massachusetts, United States Contact Info
557 followers 500+ connections

Join to view profile

Experience

  • BCG X Graphic

    Senior Data Scientist

    BCG X

    - Present 1 year 7 months

    Boston, Massachusetts, United States

  • Indigo Graphic

    Software Engineer 2

    Indigo

    - 1 year 2 months

    Boston, Massachusetts, United States

    • Worked primarily with Python and SQL on the core modeling team sitting at the end of the carbon crediting pipeline.
    • Responsible for helping to bring Indigo's carbon accounting into compliance with the Climate Action Reserve's Soil Enrichment Protocol.
    • Improved and expanded testing suite to ensure accuracy in carbon sequestration calculations.
    • Fostered productive work environment as team scrummaster.

  • Jesus College Oxford Graphic

    Lecturer, Computer Science

    Jesus College Oxford

    - 2 years

    Oxford, United Kingdom

    • One of three academics selected to lead undergraduate computer science tutorials for Jesus College pupils
    • Engage with students in private or semi-private lessons aimed at improving understanding of computer science concepts
    • Aid in college admissions and interviews as an associate member of the Senior Common Room

  • Department of Computer Science, University of Oxford Graphic

    Course Tutor/Marker

    Department of Computer Science, University of Oxford

    - 2 years 3 months

    Oxford, United Kingdom

    • Course Tutor/Marker for Artificial Intelligence, Machine Learning, and Computational Complexity
    • Reviewed assignments submitted by students and prepared tutorial lesson plan accordingly
    • Submitted bi-weekly updates on each student's progress

  • Wattson Blue Graphic

    Software Engineering Intern

    Wattson Blue

    - 1 month

    London, United Kingdom

    • Dove into existing codebase to understand which algorithms were relevant to the tasks I was assigned
    • Restructured and rewrote large portions of back-end software to significantly improve throughput

  • Stanford University

    Stanford University

    2 years 8 months

    • Stanford University Graphic

      Tutor

      Stanford University

      - 3 months

      San Francisco Bay Area

      • Held drop-in tutoring hours available to all Stanford summer students in any STEM field
      • Led workshops teaching students LaTeX and introductory programming skills necessary for coursework

    • Stanford University Graphic

      Course Assistant

      Stanford University

      - 2 years 8 months

      San Francisco Bay Area

      • Assisted in the teaching and development of courses in artificial intelligence, systems, and theory
      • Held office hours, taught material in breakout sections, and fielded student questions

      Courses included
      • Principles of Computer Systems (CS 110)
      • The Modern Algorithmic Toolbox (CS 168)
      • Finite Automata and Complexity Theory (CS 154)
      • Programming Abstractions (CS 106B)
      • Programming Methodologies (CS 106A)
      • The Mathematics of Knots, Braids, Links, and Tangles…

      • Assisted in the teaching and development of courses in artificial intelligence, systems, and theory
      • Held office hours, taught material in breakout sections, and fielded student questions

      Courses included
      • Principles of Computer Systems (CS 110)
      • The Modern Algorithmic Toolbox (CS 168)
      • Finite Automata and Complexity Theory (CS 154)
      • Programming Abstractions (CS 106B)
      • Programming Methodologies (CS 106A)
      • The Mathematics of Knots, Braids, Links, and Tangles (MATH 87Q)

  • Susquehanna International Group, LLP (SIG) Graphic

    Assistant Trader Intern

    Susquehanna International Group, LLP (SIG)

    - 3 months

    Bala Cynwyd, PA

    • Researched proprietary fixed income trading algorithms utilizing the nonlinearity of bond yield curves
    • Attended extensive daily options training on concepts including put-call parity, the Greeks, spreads, and volatility
    • Partook in open outcry mock trading sessions and poker exercises to develop understanding of pricing and game theory

  • American Institutes for Research Graphic

    Intern

    American Institutes for Research

    - 3 months

    Washington D.C. Metro Area

    • Assisted in the assessment and analysis of national and international standardized testing
    • Developed software to standardize and automatically generate internal documents

Education

  • University of Oxford Graphic

    University of Oxford

    Doctor of Philosophy - DPhil Computer Science

    -

    Activities and Societies: President of Magdalen College Middle Common Room, President of Computer Science Committee of Graduate Students, Algorithms and Complexity Representative on Joint Consultative Committee of Graduates, Student Chair and Computer Science Representative on Graduate Joint Consultative Forum of Mathematics and Physical/Life Sciences Division

    • Oxford-DeepMind Graduate Scholar
    • Oxford Computer Science Research Studentship Recipient

    • Study tradeoffs between time, memory, and randomness to understand the bounds of computation with a focus on game theoretic problems
    • Review academic papers and prove theorems regarding the mathematics behind the foundations of computer science
    • Drive towards results that indicate the existence or impossibility of efficient algorithms for certain classes of problems

  • Stanford University Graphic

    Stanford University

    Master of Science - MS Computer Science

    -

  • Stanford University Graphic

    Stanford University

    Bachelor of Science - BS Mathematics

    -

    Activities and Societies: Trumpet Section Leader and National Anthem Soloist for Leland Stanford Junior University Marching Band, Trumpet Player, Stanford Wind Symphony, Financial Officer for Stanford University Jewish Student Association, Student Leader for Weekly Religious Services, Volunteer for Stanford University Science in Service, Volunteer Teacher for Stanford Splash

  • Sidwell Friends School

    High School

    -

    Activities and Societies: Head of Sidwell Friends School Math Team, Player on Sidwell Friends School Tennis Team, Trumpet Player in Sidwell Friends School Jazz Ensemble

Licenses & Certifications

Publications

  • PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games

    International Symposium on Algorithmic Game Theory (SAGT)

    Lipschitz games, in which there is a limit λ (the Lipschitz value of the game) on how much a player’s payoffs may change when some other player deviates, were introduced about 10 years ago by Azrieli and Shmaya. They showed via the probabilistic method that n-player Lipschitz games with m strategies per player have pure ϵ-approximate Nash equilibria, for ϵ≥λ\sqrt{8nlog(2mn)}. Here we provide the first hardness result for the corresponding computational problem, showing that even for a simple…

    Lipschitz games, in which there is a limit λ (the Lipschitz value of the game) on how much a player’s payoffs may change when some other player deviates, were introduced about 10 years ago by Azrieli and Shmaya. They showed via the probabilistic method that n-player Lipschitz games with m strategies per player have pure ϵ-approximate Nash equilibria, for ϵ≥λ\sqrt{8nlog(2mn)}. Here we provide the first hardness result for the corresponding computational problem, showing that even for a simple class of Lipschitz games (Lipschitz polymatrix games), finding pure ϵ-approximate equilibria is PPAD-complete, for suitable pairs of values (ϵ(n),λ(n)). Novel features of this result include both the proof of PPAD hardness (in which we apply a population game reduction from unrestricted polymatrix games) and the proof of containment in PPAD (by derandomizing the selection of a pure equilibrium from a mixed one). In fact, our approach implies containment in PPAD for any class of Lipschitz games where payoffs from mixed-strategy profiles can be deterministically computed.

    See publication
  • Lower Bounds for the Query Complexity of Equilibria in Lipschitz Games

    International Symposium on Algorithmic Game Theory (SAGT)

    Nearly a decade ago, Azrieli and Shmaya introduced the class of λ-Lipschitz games in which every player’s payoff function is λ-Lipschitz with respect to the actions of the other players. They showed that such games admit ϵ-approximate pure Nash equilibria for certain settings of ϵ and λ. They left open, however, the question of how hard it is to find such an equilibrium. In this work, we develop a query-efficient reduction from more general games to Lipschitz games. We use this reduction to…

    Nearly a decade ago, Azrieli and Shmaya introduced the class of λ-Lipschitz games in which every player’s payoff function is λ-Lipschitz with respect to the actions of the other players. They showed that such games admit ϵ-approximate pure Nash equilibria for certain settings of ϵ and λ. They left open, however, the question of how hard it is to find such an equilibrium. In this work, we develop a query-efficient reduction from more general games to Lipschitz games. We use this reduction to show a query lower bound for any randomized algorithm finding ϵ-approximate pure Nash equilibria of n-player, binary-action, λ-Lipschitz games that is exponential in nλ/ϵ. In addition, we introduce “Multi-Lipschitz games,” a generalization involving player-specific Lipschitz values, and provide a reduction from finding equilibria of these games to finding equilibria of Lipschitz games, showing that the value of interest is the sum of the individual Lipschitz parameters. Finally, we provide an exponential lower bound on the deterministic query complexity of finding ϵ-approximate equilibria of n-player, m-action, λ-Lipschitz games for strong values of ϵ, motivating the consideration of explicitly randomized algorithms in the above results.

    See publication

Patents

  • Machine Learning Based Strength Training System and Apparatus

    Filed US 17/382,558

    We jointly designed and developed a prototype device to provide form-based feedback on weightlifting exercises using sensors positioned on the barbell and the body. In addition, we constructed a bend-sensitive knee sleeve to detect and analyze technique for strength training and physiotherapy purposes

    Other inventors

Honors & Awards

  • Bachelor's Degree with Distinction

    Stanford University

    In recognition of high scholastic attainment, the University awards the Bachelor’s Degree with Distinction. Distinction is awarded to the top 15% of the graduating class based on cumulative grade point averages calculated at the end of Winter Quarter.

  • Departmental Honors

    Stanford University Department of Mathematics

    In recognition of successful completion of special advanced work, departments may recommend their students for honors in the major. Departmental honors programs demand independent creative work at an advanced level in addition to major requirements. Departmental honors programs are not available in every academic department.
    Thesis Title: An Exploration of Derandomization and its Relaxations

  • Oxford-DeepMind Graduate Scholarship

    The University of Oxford

    The Oxford Graduate Scholarships were established in 2012 through a ground breaking matched funding initiative. Scholarships are awarded to applicants who have demonstrated excellent academic ability, who will contribute to the University’s ground-breaking research, and who will go on to contribute to the world as leaders in their field, pushing the frontiers of knowledge. The University contributes 40% of the funds for these scholarships, together with 60% from generous donations provided by…

    The Oxford Graduate Scholarships were established in 2012 through a ground breaking matched funding initiative. Scholarships are awarded to applicants who have demonstrated excellent academic ability, who will contribute to the University’s ground-breaking research, and who will go on to contribute to the world as leaders in their field, pushing the frontiers of knowledge. The University contributes 40% of the funds for these scholarships, together with 60% from generous donations provided by numerous supporters of the University and its colleges.
    DeepMind’s mission is to solve intelligence, combining the best techniques from machine learning and systems neuroscience to build powerful general-purpose learning algorithms. Their generous support has helped the Department of Computer Science continue to attract the world’s most talented scientists in core research themes as well as cross disciplinary areas.

  • Studentship for DPhil Computer Science

    The University of Oxford Department of Computer Science

  • William Lowell Putnam National Math Competition Honor Roll

    Mathematical Association of America

  • National Merit Scholar

    National Merit Scholarship Corporation

  • USA Physics Olympiad Semi-Final Exam Honorable Mention

    American Association of Physics Teachers

  • National AP Scholar

    The College Board

  • National Finalist, US National Chemistry Olympiad Competition

    American Chemical Society

  • Certificate of Excellence for Participating in the USA Junior Mathematical Olympiad

    Mathematical Association of America

  • 1st Place in District of Columbia, American Mathematics Contest

    Mathematical Association of America

Languages

  • English

    Native or bilingual proficiency

View Matthew’s full profile

  • See who you know in common
  • Get introduced
  • Contact Matthew directly
Join to view full profile

Other similar profiles

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Others named Matthew Katzman in United States