Fall 2026

Algorithmic Game Theory & Learning

ALGORITHMIC GAME THEORY & LEARNING applies computer science to game theory, focusing on algorithmic design for strategic interactions, equilibria, and mechanism design.

no offering record for this termCredits unavailable
Recorded instructors · Fall 2026 No instructors listed

Summary

No student feedback recorded yet.

Grade history

average GPA
letter grades

No recorded grade history.

All recorded terms · compare terms & instructors

Prerequisites

Course map

(COMP SCI 300 or 320), (MATH/​COMP SCI 240 or STAT/​COMP SCI/​MATH 475), and (MATH 320, 340, 341, 345 or 375), or graduate/professional standing

COMPSCI 550

This is a best-effort interpretation; check the catalog requirements above.

Prerequisite text tree

Professors

Fall 2026

No instructors recorded for this selection.

Historical instructors & teaching patterns

Recorded history may be incomplete and does not establish a future schedule.

Calendar & sections

Fall 2026

Schedule loads here as you scroll.

SectionModeEnrolled / capacityWaitlist

Times are Central. Select a meeting for details; export includes recorded dates for the selected sections.

Meeting source records

No records available.

Student experience

the class

Game theory is a mathematical lens for studying interactions among strategic agents, modeling these situations as games with the goal of understanding and influencing outcomes. Core topics include non-cooperative game theory, mechanism design, and cooperative game theory, examined via the lens of a computer scientist, drawing on tools from theoretical computer science, optimization, probability, and machine learning. Themes include the impact of self-interested behavior on others and on societal outcomes, the emergence of equilibria under such behavior, how such equilibria can be computed or approximated, designing mechanisms to ensure fair and efficient outcomes, and how cooperation can lead to fair value distribution. Particular emphasis is placed on studying, designing, and implementing algorithms.

difficulty & workload

No workload feedback recorded.

Topics

  • Non-cooperative game theory, mechanism design, and cooperative game theory.
  • Impact of self-interested behavior on societal outcomes.
  • Emergence and computation of equilibria.
  • Fair value distribution through cooperation.

Skills

  • Designing and implementing algorithms for game-theoretic problems.
  • Designing mechanisms for fair and efficient outcomes.
  • Modeling strategic interactions and influencing outcomes.

Grades

Instructor

Grade distribution · % of letter grades

No grades available yet.

More grade details Grade mix, volume & source data

Sources & history

UW–Madison

Catalog & offerings

Descriptions, prerequisites, and recorded course offerings.

Catalog observation history

Observations at scan time; dates do not imply when a catalog change took effect.

Selected offering source records

No offering records for the selected term.

Raw records
[]
Rate My Professors

Student reviews

Original comments behind the course and instructor summaries.

Read original reviews

No records available.

Madgrades

Grade history

Recorded grade distributions by term, section, and instructor.

Explore recorded grades
Model outputs & technical records
nvidia/Qwen3.6-35B-A3B-NVFP4
LLM outputs across runs
Full model traces

Recorded model configuration, reasoning, and tool conversations.

Model & dataset provenance
{
  "model": "nvidia/Qwen3.6-35B-A3B-NVFP4",
  "model_revision": "1355db6a052410cfd62085d94b58866fd0f2c3c5",
  "task_version": "14",
  "output_id": "0f6763ba0b7044e92c4ef0e0559cc40dac0d2e93fc24d71842a344466abbc0c2",
  "requirements_status": "needs_review",
  "dataset_revision": "e243353dcb7d79b7247ced91d69443ef4c2a6349",
  "observed_at": "2026-09-07 15:55:43.033547+00:00"
}