at TU München | Flashcards & Summaries

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

It’s completely free

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:

Money Pump

a < b < c < a
if you pay one euro because you prefer the next version someone can trade you the the Better versions for the lower ones +1 euro and can distract infinite euros from you.

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

A preference relation is called rational if it is?

complete (i.e., ∀x,y ∈ A: (x ≿ y) ∨ (y ≿ x))

and

transitive (i.e., ∀x,y,z ∈ A: (x ≿ y) ∧ (y ≿ z) ⇒ (x ≿ z)).

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

Transitivity means ... (in one word)

Indistinguishability

This was only a preview of our StudySmarter flashcards.

Millions of flashcards created by students

Create your own flashcards as quick as possible

Learning-Assistant with spaced repetition algorithm

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

Continuity (definition)

For all L1 ≻ L2 ≻ L3, there is some p ∈ (0,1) such that L2 ~ [p : L1, (1-p) : L3].

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

Continuity implies that, ...

Continuity implies that, if the probability of a plane crash (L3) is sufﬁciently small, you still prefer ﬂying to Hawaii.

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

Independence (definition)

For all L1, L2, L3 and all p ∈ (0,1), L1 ≿ L2 ⇔ [p : L1, (1-p) : L3] ≿ [p : L2, (1-p) : L3]

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

Independence implies that ...

Independence implies that an equal probability of a plane crash (L3) for each trip (no matter how large) will not affect your preference.

This was only a preview of our StudySmarter flashcards.

Millions of flashcards created by students

Create your own flashcards as quick as possible

Learning-Assistant with spaced repetition algorithm

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

What do we need to get a von Neumann expected utility theorem?

if take all 4 axioms(transitivity, completeness, continuity, independence), then we get von Neumann expected utility theorem

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

Risk Aversion

Utility can be very different from monetary value.

People buy insurances because their utility is concave in value. They are risk-averse.

People buy lottery tickets because their utility is convex in value. They are risk-seeking.

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

Allais Paradox

Which lottery would you prefer?

L1 = [1: €1million]
L2 = [0.98: €3million, 0.02: nothing]
L3 = [0.050: €1million, 0.950: nothing]
L4 = [0.049: €3million, 0.951: nothing]
Numerous experiments have shown that most people prefer L1 to L2 and L4 to L3.
These preferences cannot be explained by expected utility!
The independence axiom implies that L1 ≻ L2 ⇔ L3 ≻ L4.

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

why are there either 1 ore infinitely many best responses?

As son as there are 2 best responses, you can linearly combine those responses with different weights on each response (as long as Sum(weights) = 1 ) to form new responses.

This was only a preview of our StudySmarter flashcards.

Millions of flashcards created by students

Create your own flashcards as quick as possible

Learning-Assistant with spaced repetition algorithm

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

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.

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.

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.

Algorithmic Game Theory at TU München

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

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:

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

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

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

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

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

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

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

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

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

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

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

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

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

Other courses from your degree program

ACN

Blockchain

Cognitive System

POM

Databases for modern CPU

Protein Prediction I

Data Analysis in R

18WS_Strategisches_IT_Management

Patterns

Softwaretechnik

POM

Autonomous Driving

Requirements Engineering

Web Application Engineering

Patterns in Software Engineering

Business Analytics

Echtzeitsysteme

Patterns in Software Engineering

Principles of Economics

Natural Language Processing

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

Natural Language Processing

Virtual Machines

SEBA Master

SEBA

SEBA

Niemiecki A1-A2

Zjsjdb

Machine Learning

Ida Bohatta - Leben und Werk

Hauptstädte

Hauptstädte

English

Algorithmendesign at

Theory at

Theory at

Game Theory at

Algorithms at

Similar courses from other universities

What is StudySmarter?

What is StudySmarter?

Good grades at university? No problem with StudySmarter!

89% of StudySmarter users achieve better grades at university.

Learn with over 1 million users on StudySmarter.