what the study of interacting decision makers economy
play

What? The study of interacting decision makers Economy Biology - PowerPoint PPT Presentation

What is game theory? What is game theory? How do we study it? What is game theory? How do we study it? Where is research headed? What? The study of interacting decision makers Economy Biology Sociology Computer Science Engineering Different


  1. What is game theory?

  2. What is game theory? How do we study it?

  3. What is game theory? How do we study it? Where is research headed?

  4. What?

  5. The study of interacting decision makers

  6. Economy

  7. Biology

  8. Sociology

  9. Computer Science

  10. Engineering

  11. Different agendas

  12. What?

  13. What? ◮ study of interacting decision makers

  14. What? ◮ study of interacting decision makers ◮ interdisciplinary field

  15. What? ◮ study of interacting decision makers ◮ interdisciplinary field ◮ different agendas

  16. How?

  17. Decision maker

  18. Decision maker ◮ choices, C

  19. Decision maker ◮ choices, C ◮ preferences, �

  20. Decision maker ◮ choices, C ◮ preferences, � utility function, u : C → R c 1 � c 2 ⇐ ⇒ u ( c 1 ) ≥ u ( c 2 )

  21. C = { L, R }

  22. C = { L, R } u : C → R L �→ 0 R �→ 1

  23. C = { L, R } u L 0 u : C → R 1 R L �→ 0 R �→ 1

  24. r ( t ) e ( t ) s ( t ) y ( t ) K P −

  25. r ( t ) e ( t ) s ( t ) y ( t ) K P − ◮ C = { stabilizing controller K }

  26. r ( t ) e ( t ) s ( t ) y ( t ) K P − ◮ C = { stabilizing controller K } ◮ u ( K ) = − τ r ( K )

  27. Optimality Decision maker: ◮ choices, C ◮ utility function, u

  28. Optimality Decision maker: ◮ choices, C ◮ utility function, u Goal of decision maker: max c ∈ C u ( c )

  29. Game Theory

  30. Game Theory ◮ players, { i }

  31. Game Theory ◮ players, { i } ◮ choices for player i , C i

  32. Game Theory ◮ players, { i } ◮ choices for player i , C i ◮ joint choices, C = � i C i c ∈ C = ( c i , c − i )

  33. Game Theory ◮ players, { i } ◮ choices for player i , C i ◮ joint choices, C = � i C i c ∈ C = ( c i , c − i ) ◮ utility function for player i , u i : C → R

  34. Optimality? Goal of decision maker i : � � max c ∈ C u i ( c i , c − i ) � = max c ∈ C u i ( c i )

  35. Example: Prisoner’s dilemma C D C 2 , 2 − 1 , 3 3 , − 1 0 , 0 D

  36. Example: Prisoner’s dilemma C D C 2 − 1 3 0 D

  37. Example: Prisoner’s dilemma C C 2 3 D

  38. Example: Prisoner’s dilemma C C 2 3 D Best response, BR i : C − i ⇒ C i

  39. Example: Prisoner’s dilemma C C 2 3 D Best response, BR i : C − i ⇒ C i ◮ BR 1 ( C ) = { D }

  40. Example: Prisoner’s dilemma D C − 1 0 D Best response, BR i : C − i ⇒ C i ◮ BR 1 ( C ) = { D }

  41. Example: Prisoner’s dilemma D C − 1 0 D Best response, BR i : C − i ⇒ C i ◮ BR 1 ( C ) = { D } , BR 1 ( D ) = { D }

  42. Example: Prisoner’s dilemma C D C 2 , 2 − 1 , 3 3 , − 1 0 , 0 D Best response, BR i : C − i ⇒ C i ◮ BR 1 ( C ) = { D } , BR 1 ( D ) = { D }

  43. Example: Prisoner’s dilemma C D C 2 , 2 − 1 , 3 3 , − 1 0 , 0 D Best response, BR i : C − i ⇒ C i ◮ BR 1 ( C ) = { D } , BR 1 ( D ) = { D } ◮ BR 2 ( C ) = { D } , BR 2 ( D ) = { D }

  44. Nash equilibrium a ∗ = ( a ∗ i , a ∗ − i ) is a Nash equilibrium:

  45. Nash equilibrium a ∗ = ( a ∗ i , a ∗ − i ) is a Nash equilibrium: ◮ ∀ i , a ∗ i is a best response to a ∗ − i

  46. Nash equilibrium a ∗ = ( a ∗ i , a ∗ − i ) is a Nash equilibrium: ◮ ∀ i , a ∗ i is a best response to a ∗ − i ◮ no unilateral deviation is profitable

  47. Nash equilibrium a ∗ = ( a ∗ i , a ∗ − i ) is a Nash equilibrium: ◮ ∀ i , a ∗ i is a best response to a ∗ − i ◮ no unilateral deviation is profitable ◮ ∀ i , ∀ a i ∈ A i , u i ( a ∗ i , a ∗ − i ) ≥ u i ( a i , a ∗ − i )

  48. Existence of Nash equilibria Every n -player game has a Nash equilibrium.

  49. Extensions

  50. Extensions ◮ history-dependent strategy

  51. Extensions ◮ history-dependent strategy ◮ imperfect information

  52. Extensions ◮ history-dependent strategy ◮ imperfect information ◮ cooperation

  53. Extensions ◮ history-dependent strategy ◮ imperfect information ◮ cooperation ◮ large populations

  54. Back to the agendas

  55. Back to the agendas ◮ descriptive

  56. Back to the agendas ◮ descriptive ◮ predictive

  57. Back to the agendas ◮ descriptive ◮ predictive ◮ manipulative

  58. How?

  59. How? ◮ interacting decision maker

  60. How? ◮ interacting decision maker ◮ best response

  61. How? ◮ interacting decision maker ◮ best response ◮ Nash equilibrium

  62. Where?

  63. Learning Controls ⇒ Game Theory:

  64. Learning Controls ⇒ Game Theory: ◮ stability and robustness

  65. Learning Controls ⇒ Game Theory: ◮ stability and robustness ◮ derivative control

  66. Decentralized control Game Theory ⇒ Controls:

  67. Decentralized control Game Theory ⇒ Controls: ◮ network formation

  68. Decentralized control Game Theory ⇒ Controls: ◮ network formation ◮ communication limitations

  69. Dynamic Games

  70. Dynamic Games ◮ network security

  71. Dynamic Games ◮ network security ◮ learning in repeated games

  72. Where?

  73. Where? ◮ learning

  74. Where? ◮ learning ◮ decentralized control

  75. Where? ◮ learning ◮ decentralized control ◮ dynamic games

  76. Questions? Comments?

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend