07

8
D

A
BE
3

A9
28
Paper / Subject Code: 42378 / Game Theory for Data Science

B0

20
D2
3A

07

E8
40

A
A9
28
B0

2B

20
C5

3A

07

E8
40

D
60

A9
8
B0

2B
C5
2C

2
3A

7
40

9D
0
19

0
6

8
B0
5
C
64

7A
Time: 3 hours Max. Marks: 80

A2
0C
92
35

40

80
3
6
41

A9
B0
0A

C5
C

A2
56

2
N.B. (1) Question No. 1 is compulsory.

07
40
60
82

19

3
3

8
B0
A

C5
(2) Attempt any three questions from remaining five questions.

2C
BE

2
6
0

3A
5

40
0
2

19
(3) All questions carry equal marks.

D2

C6
8

B0
A

C5
BE

4
A9
(4) Assume suitable data, if required and state it clearly.

56
20

0
0
19
2

3
3

54
6
07

8
D

B0
A

2C
E

64
Q1. Attempt any four. 20

A9

0C
28

35

40
82

19
D2
3A

6
7

0A

5
2C
80

BE

64
a. List and describe the essential elements of a game in the context of game theory

C
B0

A
2

60
82

19
2
A

A3
7
40

D
b. Compare non-cooperative games with cooperative games.

2C
0

BE

64
3

A9
8
B0

0
C5

A2

5
82

9
D2

6
07

41
c. Explain the significance of the discount factor in the context of repeated games. How does
40
60

0A

2C
E
03

9
8

56
2B
C5
2C

7A
it affect the players' strategies and outcomes over multiple rounds?

A2
B

82

19
3
40

D
0
19

0A
0

64
3
6

9
8
0

B
C5
C
64

d. Define what is meant by "mechanism design" in the context of aggregating preferences.

7A
A2

35
0B

82
2
2
35

9D
0
9

0A
0

BE
03
54
6
1

8
0A

e. What do you mean by bargaining in context of game theory.

2C
4

7A
A2
0B

82
C
6

2
35

9D
0
2

19

80

BE
03
4
C6
E8

Q2.a) Write two real-world applications of game theory and explain how it has been used to
0A

5
64

7A
A2
0B
0C

D2
2B

2
5
2

19

80
03
3

54
C6
E8
9D

A9
analyze strategic decision-making in those contexts. 20
A

2
0B
0C
6
2B

92

3A
7A

07
5
2

b) Explain in detail the prisoner’s dilemma (PD) with payoff matrix and with suitable
3

54
C6
8

41
9D

28
B0
0A
80

BE

0C
56

92

3A
7A

examples.
A2

40
82
2

A3

C6
41
9D

B0
C5
80

BE
03

56
0

92

Q3.a) Define Bayesian Nash Equilibrium and find the value of p according to BNE in below given
7A
A2

40
0B

60
82
D2

A3

41

C5
2C
80

BE
03
54

56
20

payoff matrices. 20
A
A2
0B

60
0C

9
2

A3
7

41
D

2C
0

E
03
54
6

9
8

56
B

20
2C

7A
A2
0B
0C

19
2

A3
E8
9D
9

80

64
03
54
6
41

2B

20
2C

7A
A2

35
0B
0C
56

E8
D
9

0A
0
03
A3

54
6
41

A9
8

B
2C

A2
0B

82
0C
6

D2
07
35

BE
03
54
6
41

A9
28
A

2C

0B
0C
6

D2
20

3A

7
35

0
54
6
E8

41

A9
8
0
A

2C

2
0B
0C
6
B

20

3A

07
35

9
D2

54
C6
E8

41

28
B0
A

0C
6
B

20

92

3A
35

40
D2

b) Refer the below payoff matrix and identify the strategic game involved in it and describe it in
6
E8

41

B0
A

C5
C
9

brief.
6
B

20

92
7A

35

40
60
D2

E8

41
A

C5
C
80

56
B

20

92
7A
A2

60
D2

A3
E8

41

2C
80

56
B

20
7A
A2

19
D2

3
E8

A
80

64
3

9
B0

20
7A
A2

35
D2

E8
40

0A
80
3

9
B0

B
5

7A
A2

82
0C

D2
40

80

BE
3

9
B0
5

7A
A2
0C

D2
40

80
3

44249 Page 1 of 2
C6

A9
B0
5

A2
0C
2

07
40
19

3
C6

28
B0
5
4

0C
56

3A
40
19

C6

B0
C5
64

3564192C60C540B03A2807A9D2BE820A
35

40
60
19
 56 0C A2 D2 A3
4 19 540 80 B E8
56
41
2 B0 7A 20 9
35 C6 3 9 A 2C
64 0C A2 D2
B 35 6
19 5 40 80 E8 6 41
0C
54
2 B0 7A 20 9 0B
C6 3 9 A 2C
0C A2 D2
B 35 6 03
19 5 40 80 E8 6 41
0C
54
A2
80
2 B0 7A 20 9 0B 7A
C6 3 9 A 2C
0C A2 D2 35 6 03 9D

44249
5 40 80 B E8 6 41
0C
54
A2 2B
B0 7A 20 9 0B 80 E8
3 9 A 2C 7A 2
theory.
60 A2 D2 35 6 03 9D 0A
C5
40 80 B E8 6 41
0C
54
A2 2B 35
B0 7A 20 9 80 E8 64
9 2C 0B 7A 2 19
3 A2 D2 A 35 6 03 2C 9D 0A
0C B 6 2

b) Repeated Games
80 A2 60 35
40 E8 41 54 8 BE 6 4

a) VCG mechanisms.
B0 7A 20 92 0B 0 7 8 1
C5
3A 9 C6 A 9 2 0 9 2
40
D2 A3 03 A 3 C 6
B0
Explain with examples.
28
07 B E8
56
41
0C
54
A2 D2
BE 5 0 3A
80 64
Q6. Write short note on any two
C5 28
A9 20 92 0B 7A 82 19 40 07
A 3 C 6 03 9 0A 2C B0
D2
56 0C D 2 3 6 3
A9
BE 41 54
A2
8 BE 5 6 0 A 2
D2
82 92 0B 0 7A 82 4 19
C5
40 80 BE
0A
35 C 60 0 3A 9D 0 2 C6 B 7A9 82
2
A3 03 D 0A
64 C5 28 B 56 0 C A2 2 35
19 40 07 E 8 41 54 8 0 BE 64
2C B0 A9 20 92 0B 7A 8 2 19
60 3A D A3 C6 0 3 9 0 A 2C
C5 28 2B 56 0C A2 D2 3 60
40 0 7 E8 41 5 8 B 56

Page 2 of 2
B0 A9 20 92 4 0B 07 E8 41 C5
40
Q4 a) Explain zero sum games in non-cooperative games

3A C6 A9 20 92
D2
B
A3
0C
03 D A 3 C 6
B0
3
28 56 A2 2 5 6 0
*******************
07 E8 41 54 8 0 BE 4 C5
c) Computing Solution Concepts of Normal – Form Games

A9 20 92 0B 7A 82 19 40
0 2
Q5.a) Explain subgame perfect Nash equilibrium in game theory

C6 9

3564192C60C540B03A2807A9D2BE820A
D2
BE
A3
56 0C
03
A2 D2 A 3 C 6
B0
3A
41 54 8 BE 56 0C
82
0A 9 2C 0B 0 7A 82 4 19 5 40 28
07
35 60 03 9 D 0A 2C B0
64 C5 A2 2B 35 60 3A
19 40 80
7A E 82
64
19
C5
40 28
07
2C B0 0 2
Paper / Subject Code: 42378 / Game Theory for Data Science

60 3A 9D A3 C6 B0 A9
C5 2 2 B 5 0 3A D
40 80
7A E 82
64
19
C5
40 2 8
B0 0A 2C B0 07
3A 9D A9
28 2 BE 3 5 6 0 3 A2 D2
07 64 C5 8 BE
A9 82
0A
19
2C
40
B0 0 7 8
A9
D2 3 6 3 D
b) Discuss the concept of optimality and concept of Pareto efficiency in the context of game

56 0C
b) What do you mean games with Perfect Information and games with imperfect information.

A2
20

BE 2B
20
20

41 54 80
82
0A 9 2C 0 B0 7A E8
20
35 60 3A 9D A
64 C 5 2 8 2B
19 40 07 E8
2C B0 A9 20
6 3 A