# 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