Shared Flashcard Set

Details

Game Theory
Final
5
Computer Science
Undergraduate 4
12/18/2013

Additional Computer Science Flashcards

 


 

Cards

Term

Which of the following games does NOT have a pure Nash Equilibrium?

A) coordination game

B) Matching pennies

C) Battle of the Sexes

D) Prisoner's Dilemma

E) All have a pure Nash Equilibirum

Definition
B) Matching pennies
Term

Which of the following games is a constant-sum game?

A) coordination game

B) matching pennies

C) Battle of the sexes

D) Prisoner's Dilemma

E) A) and C)

Definition
B) Matching pennies
Term

For a two-player normal form game which of the following is correct as of today?

A) we can find a pure Nash Equilibirum in polynomial time

B) We can find a mixed Nash Equilibium in polynomial time

C) We can find a correlated Equilibirum in polynomial time

D) A and C

E) A and B

 

Definition

D) A and C

A) we can find a pure Nash Equilibirum in polynomial time

C) We can find a correlated Equilibirum in polynomial time

Term

Which of the following statements is NOT correct?

A) A simple game is a supper-additive game

B) A supper additive game is a convex game

C) An additive game is a supper additive game

D) an additive game is a constant sum game

E) a proper simple game is a simple game

Definition
A) A simple game is a supper-additive game
Supporting users have an ad free experience!