Chapter 16 Negotiation 1.Costly Agreements 2.Ultimatum game with Incomplete Information 3.Counteroffers with Incomplete Information 4.The revelation principle.

Slides:



Advertisements
Similar presentations
Reaching Agreements II. 2 What utility does a deal give an agent? Given encounter  T 1,T 2  in task domain  T,{1,2},c  We define the utility of a.
Advertisements

CPS Bayesian games and their use in auctions Vincent Conitzer
Arbitration. Introduction In this section we will consider the impact of outside arbitration on coordination games Specifically, we will consider two.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Chapter 5 Finance Application (i) Simple Cash Balance Problem (ii) Optimal Equity Financing of a corporation (iii) Stochastic Application Cash Balance.
Any Questions from Last Class?. Chapter 14 Bargaining COPYRIGHT © 2008 Thomson South-Western, a part of The Thomson Corporation. Thomson, the Star logo,
Auctions. Strategic Situation You are bidding for an object in an auction. The object has a value to you of $20. How much should you bid? Depends on auction.
Pablo Serra Universidad de Chile Forward Contracts, Auctions and Efficiency in Electricity Markets.
Games With No Pure Strategy Nash Equilibrium Player 2 Player
© 2009 Pearson Education Canada 16/1 Chapter 16 Game Theory and Oligopoly.
Chapter 14 Infinite Horizon 1.Markov Games 2.Markov Solutions 3.Infinite Horizon Repeated Games 4.Trigger Strategy Solutions 5.Investing in Strategic Capital.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
4 Why Should we Believe Politicians? Lupia and McCubbins – The Democratic Dilemma GV917.
Part 3: The Minimax Theorem
Rational Expectations and the Aggregation of Diverse Information in Laboratory Security Markets Charles R. Plott, Shyam Sunder.
Game Theory “Necessity never made a good bargain.” - Benjamin Franklin Mike Shor Lecture 13.
1 Unless otherwise noted, the content of this course material is licensed under a Creative Commons Attribution – Non-Commercial 3.0 License.
Game Theory The study of rational behavior among interdependent agents Agents have a common interest to make the pie as large as possible, but Agents have.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Lecture 4 on Individual Optimization Risk Aversion
QR 38 Bargaining, 4/24/07 I. The bargaining problem and Nash solution II. Alternating offers models.
Goods Prices and Factor Prices: The Distributional Consequences of International Trade Nothing is accomplished until someone sells something. (popular.
Developing Principles in Bargaining. Motivation Consider a purely distributive bargaining situation where impasse is costly to both sides How should we.
Incomplete Contracts Renegotiation, Communications and Theory December 10, 2007.
Renegotiation Design with Unverifiable Info Dylan B. Minor.
Sampling Distributions
Two-Stage Games APEC 8205: Applied Game Theory Fall 2007.
Introduction to Game Theory
Chapter 15 Bargaining with Complete Information 1.Scope and Scale of Bargaining 2.Ultimatum Game 3.Multiple rounds 4.Multilateral bargaining 5.Matching.
Our final lecture analyzes optimal contracting in situations when the principal writing the contract has less information than the agent who accepts or.
Chapter 9 Games with Imperfect Information Bayesian Games.
Investment Analysis and Portfolio management Lecture: 24 Course Code: MBF702.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
Lecture 2 in Contracts Employment Contracts This lecture studies how those who create and administer organizations design the incentives and institutional.
Bargaining, Reputation and Strategic Investment Professor Robert A. Miller Mini 3,
Chapter 6 Investment Decision Rules
Nash equilibrium Nash equilibrium is defined in terms of strategies, not payoffs Every player is best responding simultaneously (everyone optimizes) This.
Auction and Markets Professor Robert A. Miller January 2010 Teaching assistant:Hao Xue
Bargaining Whoever offers to another a bargain of any kind, proposes to do this. Give me that which I want, and you shall have this which you want …; and.
Lecture 2 An Introduction to Contracts This lecture completes our discussion of bargaining by showing what happens when there is incomplete information.
Games with Imperfect Information Bayesian Games. Complete versus Incomplete Information So far we have assumed that players hold the correct belief about.
Table of Contents Solving Quadratic Equations – Square Root Method The square root method can be used to solve a quadratic equation that can be set up.
Solving Quadratic Equations – Square Root Method The square root method can be used to solve a quadratic equation that can be set up into the following.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
This lecture introduces a second principle for solving games with only singleton information sets, perfect information games. Examples of these games are.
Negotiation 101 Fairness and the importance of looking ahead.
Lecture 7 Course Summary The tools of strategy provide guiding principles that that should help determine the extent and nature of your professional interactions.
Extensive Games with Imperfect Information
Static Games of Incomplete Information
제 10 장 게임이론 Game Theory: Inside Oligopoly
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Lecture 1 in Contracts Nonlinear Pricing This lecture studies how those who create and administer organizations design the incentives and institutional.
This lecture analyzes how well competitive equilibrium predicts industry outcomes as a function the of the production technology, the number of firms and.
Lecture 1 on Bargaining Setting the Agenda This lecture focuses on the well known problem of how to split the gains from trade or, more generally, mutual.
Chapter 8: Simple Linear Regression Yang Zhenlin.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
A Supplier’s Optimal Quantity Discount Policy Under Asymmetric Information Charles J. Corbett Xavier de Groote Presented by Jing Zhou.
Chapter 6 Extensive Form Games With Perfect Information (Illustrations)
Extensive Form Games With Perfect Information (Illustrations)
Bargaining games Econ 414. General bargaining games A common application of repeated games is to examine situations of two or more parties bargaining.
Incomplete Information and Bayes-Nash Equilibrium.
MTH 105. FINANCIAL MARKETS What is a Financial market: - A financial market is a mechanism that allows people to trade financial security. Transactions.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Lecture V: Bargaining Recommended Reading: Dixit & Skeath, Chapter 17 Osborne, Chapter 6.1, 16 Powell, In the Shadow of Power, Ch. 3.
Lecture 5 Bargaining This lecture focuses on the well known problem of how to split the gains from trade or, more generally, mutual interaction when the.
Management support systems II
Lecture 10 Coordination and Reputation
Lecture 4 Bargaining and Contracts
Presentation transcript:

Chapter 16 Negotiation 1.Costly Agreements 2.Ultimatum game with Incomplete Information 3.Counteroffers with Incomplete Information 4.The revelation principle

1.Costly Agreements We should not discount the possibility that sometimes the parties may not wish to reach an agreement, and are following the rules of negotiations for some ulterior purpose.

Bargaining with full information Two striking features characterize all the solutions of the bargaining games that we have played so far: 1. An agreement is always reached. 2. Negotiations end after one round. This occurs because nothing is learned from continuing negotiations, yet a cost is sustained because the opportunity to reach an agreement is put at risk from delaying it. Next week we explore the implications of relaxing these two assumptions.

Reaching agreement may be costly Yet there are many situations where conflict is not instantaneously resolved, and where negotiations break down: 1. In industrial relations, negotiations can be drawn out, and sometimes lead to strikes. 2. Plans for construction projects are discussed, contracts are written up, but left unsigned, so the projects are cancelled. 3. Weddings are postponed and called off.

The blame game Consider the following experiment in a multi-round bargaining game called BLAME. There are two players, called BBC and a GOVT. At the beginning of the game BBC makes a statement, which is a number between zero and one, denoted N. (Interpret N as a proportion of blame BBC is prepared to accept.) The GOVT can agree with the BBC statement N or refute it. If the GOVT agrees with the statement then the BBC forfeits £N billion funding, and the GOVT loses 1 - N proportion of the vote next election.

Counter proposal If the GOVT refutes the statement, there is a 20 percent chance that no one at all will be blamed, because a more newsworthy issue drowns out the conflict between BBC and GOVT. If the GOVT refutes the statement, and the issue remains newsworthy (this happens with probability 0.8), the GOVT issues its own statement P, also a number between zero and one. (Interpret P as a proportion of blame the GOVT offers to accept.) Should the BBC agree with the statement issued by the GOVT, the GOVT loses P proportion of the vote in the next election, and the BBC loses £5(1-P) billion in funds.

Endgame Otherwise the BBC refutes the statement of the GOVT, an arbitrator called HUTTON draws a random variable from a uniform distribution with support [0,2] denoted H, the BBC is fined £H billion, and the GOVT loses H/5 proportion of the vote next election. What will happen? The solution can be found using backwards induction. (See the footnotes or read the press!)

Evolving payoffs and discount factors Suppose two (or more) parties are jointly liable for a debt that neither wishes to pay. The players take turns in announcing how much blame should be attributed to each player, and the game ends if a sufficient number of them agree with a tabled proposal. If a proposal is rejected, the total liability might increase (since the problem remains unsolved), or decline (if there is some chance the consequences are less dire than the players originally thought). If the players do not reach a verdict after a given number of rounds, another mechanism, such as an independent enquiry, ascribes liability to each player.

Summarizing bargaining outcomes when there is complete information If the value of the match is constant throughout the bargaining phase, and is known by both parties, then the preceding discussion shows that it will be formed immediately, or not at all. The only exception occurs if the current value of the match changes throughout the bargaining phase as the players gather new information together.

2.Ultimatum game with incomplete information If the value of the match is constant throughout the bargaining phase, and is known by both parties, then the preceding discussion shows that it will be formed immediately, or not at all. In the segment on this topic, we will relax the assumption that all the bargaining parties are fully informed. We now modify the original ultimatum game, between a proposer and a responder, by changing the information structure. Suppose the value to the responder of reaching an agreement is not known by the proposer.

An experiment In this game: 1. The proposer demands s from the responder. 2. Then the responder draws a value v from the probability distribution F(v). For convenience we normalize v so that v 0  v  v The responder either accepts or rejects the demand of s. 4. If the demand is accepted the proposer receives s and the responder receives v – s, but if the demand is rejected neither party receives anything.

The proposer’s objective The responder accepts the offer if v > s and rejects the offer otherwise. Now suppose the proposer maximizes his expected wealth, which can be expressed as: Pr{v > s}s = [1 – F(s)]s Notice the term in the square brackets [1 – F(s)] is the quantity sold, which declines in price, while s is the price itself.

Solution to the game Let s o denote the optimal choice of s for the proposer. Clearly v 0  s o < v 1. If v 0 < s o < v 1, then s o satisfies a first order condition for this problem: 1 – F’(s o ) s o – F(s o ) = 0 Otherwise s o = v 0 and the proposer receives: [1 – F(v 0 )]v 0 = v 0 The revenue generated by solving the first order condition is compared with v 0 to obtain the solution to the proposer’s problem.

F(s) is a uniform distribution Suppose: F(v) = (v – v 0 )/ (v 1 – v 0 ) for all v 0  v  v 1 which implies F’(v) = 1 /(v 1 – v 0 ) for all v 0  v  v 1 Thus the first order condition reduces to: 1 – s o /(v 1 – v 0 ) – (s o – v 0 )/ (v 1 – v 0 ) = 0 => v 1 – v 0 – s o – s o + v 0 = 0 => 2 s o = v 1

Solving the uniform distribution case In the interior case s o = v 1 /2. It clearly applies when v 0 = 0, but that is not the only case. We compare v 0 with the expected revenue from the interior solution v 1 (v 1 – 2v 0 )/(v 1 – v 0 ). If v 0 > 0 define v 1 = kv 0 for some k > 1. Then we obtain an interior solution if k > 1 and: k(k – 2) > k – 1 => k 2 – 3k + 1 > 0 So an interior solution holds if and only if k exceeds the larger of the two roots to this equation, that is k > ( /2 )/2.

F(s) is [0,1] uniform More specifically let: F(v) = v for all 0  v  1 Then the interior solution applies so s o = ½, and F(v) = ½. Thus exchange only occurs half the time it there are gains from trade. The trading surplus is: Given our assumption about F(v) it follows that ¼ of the trading surplus is realized, which is ½ of the potential surplus.

3.Counteroffers when there is incomplete information Allowing for counteroffers introduces the possibility that that information might be shared.

Counteroffers Since there is only one offer, there is no opportunity for learning to take place during the bargaining process. We now extend the bargaining phase by allowing the player with private information to make an initial offer. If rejected, the bargaining continues for one final round. For convenience we assume throughout this discussion that F(v) is uniform [0,1].

Solution when there are counteroffers The textbook analyzes solutions of the following type: 1. There is a threshold valuation v* such that in the first found every manager with valuation v > v* offers the same wage w*, and every manager with valuation v < v* offers lower wages. 2. In the first round the union rejects every offer below w*, and accepts all other offers. 3. If the bargaining continues to the final round the union solves the first order condition for the one round problem using the valuations of the manager as truncated at v*.

Outcomes of two round bargaining game Note that if the probability of continuation is too high, management will not offer anything in the first round, because it would reveal too much about its own private value v. In this case the bargaining process stalls because management find it strategically beneficial to withhold information that can be used against them.

4.The revelation principle The revelation principle provides a way of simplifying the set of outcomes that can occur as the outcome to some bargaining games.

What solutions do the set of bargaining rules admit? There are many bargaining games to consider Can we characterize the set of solution in a parsomonious way? The revelation principle says “yes”. This motivates our discussion for the next chapter.

Commitment Notice there is a sense of commitment in the revelation principle. Thus it may be a practical tool, but it is also a conceptual tool that can be used in prediction.