Algorithmic Game Theory at TU München

Flashcards and summaries for Algorithmic Game Theory at the TU München

Arrow Arrow

It’s completely free

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

studysmarter schule studium
d

4.5 /5

studysmarter schule studium
d

4.8 /5

Study with flashcards and summaries for the course Algorithmic Game Theory at the TU München

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Weak dominance

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Pareto-Optimality

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

When is a Maximin strategy recommended?

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

What is a mixture of maximin strategies called?

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

The security level of player i is

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Maximin strategies (and security levels) can be computed __ time.

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

How can we efficiently check whether an action is dominated by some mixed strategy?

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

How can a game be solved via iterated strict dominance?

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

What are Solution Concepts?

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Important properties of solution concepts:

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Very weak dominance

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Are succint games normal games?

Your peers in the course Algorithmic Game Theory at the TU München create and share summaries, flashcards, study plans and other learning materials with the intelligent StudySmarter learning app.

Get started now!

Flashcard Flashcard

Exemplary flashcards for Algorithmic Game Theory at the TU München on StudySmarter:

Algorithmic Game Theory

Weak dominance

ai weakly dominates bi if for all a-i ∈ A-i, ui(ai,a-i) ≥ ui(bi,a-i) and for at least one a-i ∈ A-i, ui(ai,a-i) > ui(bi,a-i).

Algorithmic Game Theory

Pareto-Optimality

An outcome is Pareto-optimal if it is not Pareto-dominated.

An outcome is (weakly) Pareto-dominated if there exists another outcome in which all players obtain at least as much utility and one player is strictly better off.

Algorithmic Game Theory

When is a Maximin strategy recommended?

In face of uncertainty, a player may maximize his worst-case utility.

When games are neither solvable via ISD nor via IWD.

Algorithmic Game Theory

What is a mixture of maximin strategies called?

The set of maximin strategies is convex, i.e., a mixture of maximin strategies is again a maximin strategy.

Algorithmic Game Theory

The security level of player i is

The security level is the minimal utility that the player can enforce.

Independent of the opponents’ rationality.

Algorithmic Game Theory

Maximin strategies (and security levels) can be computed __ time.

Maximin strategies (and security levels) can be computed in polynomial time.

Algorithmic Game Theory

How can we efficiently check whether an action is dominated by some mixed strategy?

Linear Programming (LP)

Algorithmic Game Theory

How can a game be solved via iterated strict dominance?

A game can be solved via iterated strict dominance (ISD) if only a single action profile survives the iterated elimination of dominated actions.

Algorithmic Game Theory

What are Solution Concepts?

A solution concept identifies reasonable, desirable, or otherwise significant strategy profiles of a game.

Algorithmic Game Theory

Important properties of solution concepts:

  • Existence – Games may not be solvable via ISD or IWD.
  • Uniqueness
    • If a game is solvable via ISD, the resulting action profile is unique.
    • If a game is solvable via IWD, there may be different resulting action profiles.
  • Efficient computability
    • It can be decided in polynomial time whether a game can be solved via ISD.
    • Whether a game can be solved via IWD cannot be decided in polynomial time unless P=NP.

Algorithmic Game Theory

Very weak dominance

ai very weakly dominates bi if for all a-i ∈ A-i, ui(ai,a-i) ≥ ui(bi,a-i).

Algorithmic Game Theory

Are succint games normal games?

No

Beyond the Normal Form

Sign up for free to see all flashcards and summaries for Algorithmic Game Theory at the TU München

Singup Image Singup Image
Wave

Other courses from your degree program

For your degree program Computer Science at the TU München there are already many courses on StudySmarter, waiting for you to join them. Get access to flashcards, summaries, and much more.

Back to TU München overview page

Blockchain

Cognitive System

Databases for modern CPU

Protein Prediction I

Data Analysis in R

18WS_Strategisches_IT_Management

Patterns

Softwaretechnik

Autonomous Driving

Requirements Engineering

Web Application Engineering

Business Analytics

Echtzeitsysteme

Patterns in Software Engineering

Principles of Economics

Data Mining and Knowledge Discovery

Introduction to Deep Learning

Data Mining and KD

Visual data analytics

Security Engineering

SE betr Anw

Grundlagen der Künstlichen Intelligenz

Virtual Machines

SEBA Master

What is StudySmarter?

What is StudySmarter?

StudySmarter is an intelligent learning tool for students. With StudySmarter you can easily and efficiently create flashcards, summaries, mind maps, study plans and more. Create your own flashcards e.g. for Algorithmic Game Theory at the TU München or access thousands of learning materials created by your fellow students. Whether at your own university or at other universities. Hundreds of thousands of students use StudySmarter to efficiently prepare for their exams. Available on the Web, Android & iOS. It’s completely free.

Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards
Awards

Best EdTech Startup in Europe

Awards
Awards

EUROPEAN YOUTH AWARD IN SMART LEARNING

Awards
Awards

BEST EDTECH STARTUP IN GERMANY

Awards

How it works

Top-Image

Get a learning plan

Prepare for all of your exams in time. StudySmarter creates your individual learning plan, tailored to your study type and preferences.

Top-Image

Create flashcards

Create flashcards within seconds with the help of efficient screenshot and marking features. Maximize your comprehension with our intelligent StudySmarter Trainer.

Top-Image

Create summaries

Highlight the most important passages in your learning materials and StudySmarter will create a summary for you. No additional effort required.

Top-Image

Study alone or in a group

StudySmarter automatically finds you a study group. Share flashcards and summaries with your fellow students and get answers to your questions.

Top-Image

Statistics and feedback

Always keep track of your study progress. StudySmarter shows you exactly what you have achieved and what you need to review to achieve your dream grades.

1

Learning Plan

2

Flashcards

3

Summaries

4

Teamwork

5

Feedback