1 Topics in Game Theory SS 2008 Avner Shaked. 2

Slides:



Advertisements
Similar presentations
Boyce/DiPrima 9th ed, Ch 2.4: Differences Between Linear and Nonlinear Equations Elementary Differential Equations and Boundary Value Problems, 9th edition,
Advertisements

Mathe III Lecture 1 Mathe III Lecture 1. 2 WS 2005/6 Avner Shaked Mathe III Math III.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Summary of complementary slackness: 1. If x i ≠ 0, i= 1, 2, …, n the ith dual equation is tight. 2. If equation i of the primal is not tight, y i =0. 1.
Spieltheorie II SS 2005 Avner Shaked.
Nash Game and Mixed H 2 /H  Control by H. de O. Florentino, R.M. Sales, 1997 and by D.J.N. Limebeer, B.D.O. Anderson, and Hendel, 1994 Presensted by Hui-Hung.
Equation of Tangent line
THE DERIVATIVE AND THE TANGENT LINE PROBLEM
Wstęp do Teorii Gier. Consider the following game Mrs Column AB Mr Raw A(2,6)(10,5) B(4,8)(0,0)
Negotiation A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor SIUC.
Lecture 4 Negotiating Strategy
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Approximation Algorithms for Convex Programs?!
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Algorithms for Convex Programs (Capturing Market Equilibria.
Michael Brand. Game Theory = The mathematics of joint decision-making.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Lecture 7 Negotiating Strategy 1.Axiomatic (Nash) Bargaining 2.Connection to Alternating Offers 3.Voting, Stability and Group Decisions.
Institute for Economics and Mathematics at St. Petersburg Russian Academy of Sciences Vladimir Matveenko Bargaining Powers, Weights of Individual Utilities,
Downlink Channel Assignment and Power Control in Cognitive Radio Networks Using Game Theory Ghazale Hosseinabadi Tutor: Hossein Manshaei January, 29 th,
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
Implicit Functions The equation y = mx + b is an explicit function –y is considered the dependent variable –x is the independent variable The equation.
Lecture 3 Negotiating Strategy Professor Keith Chen 1.Quick Review of the Alternating-Offers Model Thinking about the value of the future. 2.BATNA & ZOPA.
On the Aggregation of Preferences in Engineering Design Beth Allen University of Minnesota NSF DMI
1 Variations in Variation Theory and the Mathematical Theme of Invariance in the Midst of Change John Mason Loughborough May 2010 The Open University Maths.
Lecture 5 Negotiating Strategy 1.Begin Coalitional Analysis 2.Added Value and the Core 3.Axiomatic (Nash) Bargaining.
Implicit Differentiation. Objectives Students will be able to Calculate derivative of function defined implicitly. Determine the slope of the tangent.
1 Part 1: Ordinary Differential Equations Ch1: First-Order Differential Equations Ch2: Second-Order Differential Equations Ch3: The Laplace Transform Ch4:
M ARCUS D ITTRICH Wage and employment effects of non-binding minimum wages Marcus Dittrich Andreas Knabe TU Chemnitz & CESifo FU Berlin & CESifo Social.
(MTH 250) Lecture 24 Calculus. Previous Lecture’s Summary Multivariable functions Limits along smooth curves Limits of multivariable functions Continuity.
1 A1 Pareto A2 Symmetry A3 Invariance A4 IIA A1 Pareto A2 Symmetry A3 Invariance A4 IIA First, we show that there exists a function satisfying the axioms.
Sketching quadratic functions To sketch a quadratic function we need to identify where possible: The y intercept (0, c) The roots by solving ax 2 + bx.
Microeconomics 2 John Hey. Game theory (and a bit of bargaining theory) A homage to John Nash. Born Still alive (as far as Google knows). Spent.
3.1 –Tangents and the Derivative at a Point
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Combinatorial Algorithms for Convex Programs (Capturing Market Equilibria.
Sec 15.6 Directional Derivatives and the Gradient Vector
2008/01/30Lecture 11 Game Theory. 2008/01/30Lecture 12 What is Game Theory? Game theory is a field of Mathematics, analyzing strategically inter-dependent.
Algorithmic Game Theory and Internet Computing Vijay V. Vazirani Georgia Tech Primal-Dual Algorithms for Rational Convex Programs II: Dealing with Infeasibility.
19/06/2007VER2-0 (a) Find the Area bounded by the curve y=20sin200  t and the t axis. Between t=0 and t=30ms EXERCISE SET 6 – Area under a Curve & Mean.
Graphing Polar Graphs Calc AB- Section10.6A. Symmetry Tests for Polar Graphs 1.Symmetry about the x -axis: If the point lies on the graph, the point ________.
Algorithmic Game Theory and Internet Computing
ALGEBRAIC CURVES AND CONTROL THEORY by Bill Wolovich Based on Chapter 3 of the book INVARIANTS FOR PATTERN RECOGNITION AND CLASSIFICATION, World Scientific.
Differential Equations
Nash Bargaining Solution and Alternating Offer Games MIT Game Theory.
1 Transport Bandwidth Allocation 3/29/2012. Admin. r Exam 1 m Max: 65 m Avg: 52 r Any questions on programming assignment 2 2.
2( ) 8x + 14y = 4 -12x – 14y = x = x = 4 8x + 14y = 4 8(4) + 14y = y = y = -28 ___ ___ y = -2 The solution is (4, -2)
(MTH 250) Lecture 19 Calculus. Previous Lecture’s Summary Definite integrals Fundamental theorem of calculus Mean value theorem for integrals Fundamental.
Unit 2 Lesson #3 Tangent Line Problems
Paper Code : BCA-03 Paper Title : Mathematics Theory.
Differential Equations
4.4 The Fundamental Theorem of Calculus
Implicit Differentiation
Implicit Differentiation
Theory of Games and Bargaining
Advanced Engineering Mathematics
EC941 - Game Theory Lecture 8 Prof. Francesco Squintani
Algorithmic Game Theory and Internet Computing
Mathematics.
Introduction If we assume
Solve the equation for x. {image}
THE DERIVATIVE AND THE TANGENT LINE PROBLEM
The Open University Maths Dept University of Oxford Dept of Education
Solve the differential equation. {image}
Game Theory In Telecommunications
Sec 21: Analysis of the Euler Method
Tangents to Circles.
A NEGOTIATED SOLUTION FOR THE JORDAN BASIN
Find {image} by implicit differentiation:    {image} .
I.4 Polyhedral Theory (NW)
I.4 Polyhedral Theory.
Incentive equilibrium in bioresource management problem
Gradients and Tangents
Presentation transcript:

1 Topics in Game Theory SS 2008 Avner Shaked

2

3 n K. n K. Binmore Fun & Games A Text on Game Theory D.C. Heath & Co., 1992

4 n M. n M. Osborne & A. Rubinstein Bargaining and Markets Academic Press, 1990

5 n K. n K. Binmore Fun & Games A Text on Game Theory D.C. Heath & Co., 1992 n M. n M. Osborne & A. Rubinstein Bargaining and Markets Academic Press, 1990

6 A Bargaining Problem S - a feasible set d - a disagreement point Nash Bargaining Theory Nash Verhandlungstheorie John Nash

7 Nash Bargaining Theory u2u2 u1u1 S

8 u2u2 u1u1 bounded closed S

9 Nash Bargaining Theory u2u2 u1u1 A B S

10 Nash Bargaining Theory u2u2 u1u1 d S

11 Nash Bargaining Theory u2u2 u1u1 d S

12 Nash Bargaining Theory d A Nash Bargaining Solution is a function u2u2 u1u1 S

13 Nash Bargaining Theory A Nash Bargaining Solution is a function u2u2 u1u1 S d

14 Axioms A1-A4 A1 (Pareto) A2 (Symmetry) d S

15 Axioms A1-A4 A3 (Invariance to affine transformation) IIA A4 (Independence of Irrelevant Alternatives IIA)

16 Axioms A1-A4 IIA A4 (Independence of Irrelevant Alternatives IIA) u2u2 u1u1 d

17 Axioms A1-A4 IIA A4 (Independence of Irrelevant Alternatives IIA) Gives f(T,d) a flavour of maximum Pasta Fish Meat IIA is violated when

18 A1 Pareto A2 Symmetry A3 Invariance A4 IIA A1 Pareto A2 Symmetry A3 Invariance A4 IIA First, we show that there exists a function satisfying the axioms. There exists a unique satisfying A1- A4 Theorem: Proof:

19 d For any given bargaining problem define = = Does such a point always exist ?? Is it unique ?? Yes !!! Proof:

20 ? d = = Proof: does satisfy A1-A4 ?? Pareto Symmetry IIA Invariance

21 (divide the $) 0 Proof: Consider the bargaining problem Uniqueness: If satisfies the axioms then: (1,0) (0,1) By Pareto + Symmetry: A2 (Symmetry) By definition:

22 Proof: For a given bargaining problem d (a,d 2 ) (d 1,b) (d 1, d 2 ) = =

23 Proof: For a given bargaining problem d If is a degenerate Problem

24 Proof: For a given (nondegenerate) bargaining problem 0 (1,0) (0,1) d (a,d 2 ) (d 1,b) (d 1, d 2 ) Consider the bargaining problem Find an affine transformation α

25 Proof: 0 (1,0) (0,1) d (a,d 2 ) (d 1,b) (d 1, d 2 ) Find an affine transformation α

26 Proof: 0 (1,0) (0,1) d (a,d 2 ) (d 1, d 2 ) == (d 1,b) ??

27 Proof: 0 (1,0) (0,1) d (a,d 2 ) (d 1, d 2 ) == (d 1,b) ??

28 Proof: d By IIA

29 Proof: d end of proof

30 0 A Generalization Changing A2 (Symmetry) A2 (nonsymmetric) (1,0) (0,1) A B α measures the strength of Player 1

31 d For any given bargaining problem define A B With the new A2, define a different

32 d Does such a point always exist ?? Is it unique ?? Yes !!! A B Following the steps of the previous theorem, is the unique function satisfying the 4 axioms. Yes !!!

33 A brief mathematical Interlude Consider the (implicit) function Find a tangent at a point (x 0,y 0 ) on the curve differentiating y x

34 A brief mathematical Interlude Find a tangent at a point (x 0,y 0 ) on the curve x y The tangent’s equation: The intersections with the axis (x=0, y=0)

35 A B A brief mathematical Interlude x y (x 0 /α,0) (0, y 0 /(1-α)) (x 0, y 0 )

36 A B A brief mathematical Interlude x y Any tangent of the function is split by the tangency point in the ratio

37 A brief mathematical Interlude x y For any convex set S, by maximizing S end of mathematical Interlude We find the unique point in S in which the tangent is split in the ratio

38 To find the Nash Bargaining Solution of a bargaining problem S d Nash Bargaining Solution

39 All axioms were used in the proof But are they necessary? All axioms were used in the proof But are they necessary? A1. Without Pareto, satisfies the other axioms. A2. Without Symmetry, satisfies the other axioms.

40 All axioms were used in the proof But are they necessary? All axioms were used in the proof But are they necessary? A3. Without Invariance, satisfies the other axioms. S (0,1) (0,0) (2,0) d (1, 0.5) Nash Bargaining Solution

41 All axioms were used in the proof But are they necessary? All axioms were used in the proof But are they necessary? S d A4. Without IIA, the following function satisfies the other axioms. The Kalai Smorodinsky solution

42 All axioms were used in the proof But are they necessary? All axioms were used in the proof But are they necessary? S d A4. Without IIA, the following function satisfies the other axioms. The Kalai Smorodinsky solution