OpenCourser brand icon
Sign in
We may earn an affiliate commission when you visit our partners.

Game Theorist

Save
April 29, 2024 3 minute read
Jump to salaries, courses, and books

Game Theorists analyze strategic decision-making in situations where multiple agents interact with each other, often with conflicting interests. They use mathematical models to predict the behavior of these agents and determine the optimal strategies for each one. Game theory is used in a wide variety of fields, including economics, political science, computer science, and biology.

The Role of a Game Theorist

Share

Help others find this career page by sharing it with your friends and followers:
Facebook
LinkedIn
Reddit
X
Link
Email

Salaries for Game Theorist

City
Median
New York
$169,000
San Francisco
$164,000
Seattle
$168,000
See all salaries
City
Median
New York
$169,000
San Francisco
$164,000
Seattle
$168,000
Austin
$126,000
Toronto
$145,000
London
£97,000
Paris
€120,000
Berlin
€80,000
Tel Aviv
₪818,000
Singapore
S$195,000
Beijing
¥175,000
Shanghai
¥257,000
Bengalaru
₹1,534,000
Delhi
₹796,000
Bars indicate relevance. All salaries presented are estimates. Completion of this course does not guarantee or imply job placement or career outcomes.

Path to Game Theorist

Take the first step.
We've curated four courses to help you on your path to Game Theorist. Use these to develop your skills, build background knowledge, and put what you learn to practice.
Sorted from most relevant to least relevant:

Reading list

We've selected some books that we think will supplement your learning. Use these to develop background knowledge, enrich your coursework, and gain a deeper understanding of the topics covered in Game Theorist.
Cover image
Computational Complexity
Save
Presents a modern perspective on computational complexity, emphasizing algorithmic and proof techniques.
Computational Complexity: A Modern Approach
Hardcover
$$$
Computational Complexity: A Modern Approach
Kindle Edition
$$
Cover image
Turing Computability
Save
Covers the theory of computability, including Turing machines, recursion theory, and the limits of what computers can compute.
Turing Computability: Theory and Applications...
Paperback
$$$
Turing Computability: Theory and Applications...
Kindle Edition
$$$
Cover image
Approximation Algorithms
Save
Examines approximation algorithms for NP-hard problems, discussing techniques for finding efficient solutions to difficult problems.
Approximation Algorithms
Hardcover
$$$
APPROXIMATION ALGORITHMS
Unknown Binding
$$
Cover image
Parameterized Complexity Theory
Save
Introduces the theory of parameterized complexity, which studies the complexity of problems with respect to varying parameters.
Parameterized Complexity Theory (Texts in...
Paperback
$$$
Cover image
The Algorithm Design Manual
Save
Offers practical guidance on algorithm design, including techniques for handling intractable problems.
The Algorithm Design Manual (Texts in Computer...
Paperback
$$
The Algorithm Design Manual
Paperback
$$$
(The Algorithm Design Manual) [By: Skiena, Steven S...
Paperback
$$$$
The Algorithm Design Manual (Texts in Computer...
Kindle Edition
$$
The Algorithm Design Manual
Kindle Edition
$$$
Related topics
Intractability
Share this
Share to help others discover this career.
Facebook LinkedIn X Reddit Link Email
Table of Contents
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser