# game theory

Published articles for game theory.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## My Graduate Career in Math

DevFeed: [My Graduate Career in Math](<https://devfeed.tech/articles/my-graduate-career-in-math-40490.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2025/05/12/my-graduate-career-in-math/>)

Published: 2025-05-12T18:35:57Z

Content type: opinion

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Mathematics](<https://devfeed.tech/topics/mathematics.md>), [Computer science](<https://devfeed.tech/topics/computer-science.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [computer-science](<https://devfeed.tech/tags/computer-science.md>), [education](<https://devfeed.tech/tags/education.md>), [essay](<https://devfeed.tech/tags/essay.md>), [essays](<https://devfeed.tech/tags/essays.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [group-theory](<https://devfeed.tech/tags/group-theory.md>), [linear-algebra](<https://devfeed.tech/tags/linear-algebra.md>), [math](<https://devfeed.tech/tags/math.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [retrospective](<https://devfeed.tech/tags/retrospective.md>), [topology](<https://devfeed.tech/tags/topology.md>), [university](<https://devfeed.tech/tags/university.md>)

### AI overview

An autobiographical essay about the author's transition from computer science to mathematics at Cal Poly, including university coursework, study abroad in Budapest, and reflections on the intellectual environment and an early group theory project.

### Source excerpt

Editor's note: This essay was originally published on Medium on 2016-03-05. I have made minor edits in this republishing and added a few small retrospective notes. 2010-2011 (Year 0) I had just switched my major at Cal Poly State University from computer science to math. I wanted to double major but California was in a budget crisis and a few weeks before I tried submitting my double-major request the Provost for the CSU system put a blanket ban on double majors.

## Towards solving Ultimate Tic Tac Toe

DevFeed: [Towards solving Ultimate Tic Tac Toe](<https://devfeed.tech/articles/towards-solving-ultimate-tic-tac-toe-21964.md>)

Original publisher: [Read original article](<https://blog.nelhage.com/post/solving-ultimate-ttt/>)

Author: Nelson Elhage

Published: 2020-07-15T17:15:21Z

Content type: article

Language: en

Sources: [Nelson Elhage](<https://devfeed.tech/sources/nelson-elhage.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Rust](<https://devfeed.tech/topics/rust.md>), [Programming](<https://devfeed.tech/topics/programming.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [experience](<https://devfeed.tech/tags/experience.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [games](<https://devfeed.tech/tags/games.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [performance](<https://devfeed.tech/tags/performance.md>), [programming](<https://devfeed.tech/tags/programming.md>), [rust](<https://devfeed.tech/tags/rust.md>), [strategy](<https://devfeed.tech/tags/strategy.md>)

### AI overview

The article describes an ongoing effort to solve Ultimate Tic Tac Toe by developing a minimax AI and investigating algorithms from combinatorial game theory. The project also provided experience with Rust and high-performance parallel programming, but the game had not yet been solved.

### Source excerpt

Summary: Read about my efforts to solve the game of Ultimate Tic Tac Toe. It's been a fun journey into interesting algorithms and high-performance parallel programming in Rust. Backstory Starting around the beginning of the COVID-19 lockdown, I've gotten myself deeply nerdsniped by an attempt to solve the game of Ultimate Tic Tac Toe, a two-level Tic Tac Toe variant which is (unlike Tic Tac Toe) nontrivial and contains some interesting strategic elements.

## The Reasonable Effectiveness of the Multiplicative Weights Update Algorithm

DevFeed: [The Reasonable Effectiveness of the Multiplicative Weights Update Algorithm](<https://devfeed.tech/articles/the-reasonable-effectiveness-of-the-multiplicative-weights-update-algorithm-40407.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2017/02/27/the-reasonable-effectiveness-of-the-multiplicative-weights-update-algorithm/>)

Published: 2017-02-27T08:00:42Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [Programming](<https://devfeed.tech/topics/programming.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Optimization](<https://devfeed.tech/topics/optimization.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [javascript](<https://devfeed.tech/tags/javascript.md>), [linear-programming](<https://devfeed.tech/tags/linear-programming.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [multiplicative-weights-update-algorithm](<https://devfeed.tech/tags/multiplicative-weights-update-algorithm.md>), [mwua](<https://devfeed.tech/tags/mwua.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>)

### AI overview

This tutorial explains the Multiplicative Weights Update Algorithm (MWUA), including its weight-update rule, an investment-expert example, and the algorithm's theoretical guarantee for identifying a strong expert over repeated rounds. It also introduces an interactive demonstration.

### Source excerpt

papad Hard to believe Sanjeev Arora and his coauthors consider it "a basic tool [that should be] taught to all algorithms students together with divide-and-conquer, dynamic programming, and random sampling." Christos Papadimitriou calls it "so hard to believe that it has been discovered five times and forgotten." It has formed the basis of algorithms in machine learning, optimization, game theory, economics, biology, and more. What mystical algorithm has such broad applications?

## Anti-Coordination Games and Stable Graph Colorings

DevFeed: [Anti-Coordination Games and Stable Graph Colorings](<https://devfeed.tech/articles/anti-coordination-games-and-stable-graph-colorings-40330.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2013/09/09/anti-coordination-games-and-stable-graph-colorings/>)

Published: 2013-09-09T09:00:00Z

Content type: article

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Graphs](<https://devfeed.tech/topics/graphs.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [math](<https://devfeed.tech/topics/math.md>)

Tags: [announce](<https://devfeed.tech/tags/announce.md>), [anti-coordination](<https://devfeed.tech/tags/anti-coordination.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [games-on-graphs](<https://devfeed.tech/tags/games-on-graphs.md>), [graph](<https://devfeed.tech/tags/graph.md>), [graph-coloring](<https://devfeed.tech/tags/graph-coloring.md>), [graph-theory](<https://devfeed.tech/tags/graph-theory.md>), [network](<https://devfeed.tech/tags/network.md>), [np-completeness](<https://devfeed.tech/tags/np-completeness.md>), [paper](<https://devfeed.tech/tags/paper.md>), [publication](<https://devfeed.tech/tags/publication.md>), [research](<https://devfeed.tech/tags/research.md>)

### AI overview

The author announces that a first paper on anti-coordination games and stable colorings has been accepted for publication. The article introduces the problem for a general audience, explaining how graph-based friendship networks affect interactions and raising questions about stability, convergence, centralized strategies, and computational difficulty.

### Source excerpt

My First Paper I'm pleased to announce that my first paper, titled "Anti-Coordination Games and Stable Colorings," has been accepted for publication! The venue is the Symposium on Algorithmic Game Theory, which will take place in Aachen, Germany this October. A professor of mine once told me that everyone puts their first few publications on a pedestal, so I'll do my best to keep things down to earth by focusing on the contents of the paper and not my swirling cocktail of pride.

## Beauty and the Geek Game Theory: Answering the Freakonomics Challenge

DevFeed: [Beauty and the Geek Game Theory: Answering the Freakonomics Challenge](<https://devfeed.tech/articles/beauty-and-the-geek-game-theory-answering-the-freakonomics-challenge-40565.md>)

Original publisher: [Read original article](<http://norvig.com/geek.html>)

Published: 2008-08-16T00:00:00Z

Content type: article

Language: en

Sources: [Peter Norvig](<https://devfeed.tech/sources/peter-norvig.md>)

Topics: [Simulation](<https://devfeed.tech/topics/simulation.md>), [simulator](<https://devfeed.tech/topics/simulator.md>), [optimize](<https://devfeed.tech/topics/optimize.md>)

Tags: [game](<https://devfeed.tech/tags/game.md>), [game-theory](<https://devfeed.tech/tags/game-theory.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [simulation](<https://devfeed.tech/tags/simulation.md>), [simulator](<https://devfeed.tech/tags/simulator.md>)

### AI overview

The article analyzes strategy in the Beauty and the Geek elimination game described by Alon Nir. It models competing teams with different strengths, enumerates several possible player strategies, and uses simulations of 10,000 games to estimate winning probabilities.

### Source excerpt

Answering Alon Nir's Freakonomics Challenge: What strategy to use on the TV show Beauty and the Geek