Random-settlement arbitration and the generalized Nash solution:

one-shot and infinite-horizon cases

Nejat Anbarci, Kang Rong, Jaideep Roy

Research output: Contribution to journalArticle

16 Downloads (Pure)

Abstract

We study bilateral bargaining á la Nash (Econometrica 21:128–140, 1953) but where players face two sources of uncertainty when demands are mutually incompatible. First, there is complete breakdown of negotiations with players receiving zero payoffs, unless with probability p, an arbiter is called upon to resolve the dispute. The arbiter uses the final-offer-arbitration mechanism whereby one of the two incompatible demands is implemented. Second, the arbiter may have a preference bias toward satisfying one of the players that is private information to the arbiter and players commonly believe that the favored party is player 1 with probability q. Following Nash’s idea of ‘smoothing,’ we assume that 1 - p is larger for larger incompatibility of demands. We provide a set of conditions on p such that, as p becomes arbitrarily small, all equilibrium outcomes converge to the Nash solution outcome if q= 1 / 2 , that is when the uncertainty regarding the arbiter’s bias is maximum. Moreover, with q≠ 1 / 2 , convergence is obtained on a special point in the bargaining set that, independent of the nature of the set, picks the generalized Nash solution with as-if bargaining weights q and 1 - q. We then extend these results to infinite-horizon where instead of complete breakdown, players are allowed to renegotiate.

Original languageEnglish
Pages (from-to)21-52
Number of pages32
JournalEconomic Theory
Volume68
Issue number1
Early online date19 Mar 2018
DOIs
Publication statusPublished - 1 Jul 2019

Fingerprint

Nash solution
Infinite horizon
Breakdown
Arbitration
Bilateral bargaining
Bargaining set
Private information
Incompatibility
Smoothing
Dispute
Uncertainty
Final-offer arbitration
Demand uncertainty

Keywords

  • Arbitration with unknown bias
  • Incompatible demands
  • Nash bargaining
  • Nash solution
  • Random settlement

ASJC Scopus subject areas

  • Economics and Econometrics

Cite this

Random-settlement arbitration and the generalized Nash solution: one-shot and infinite-horizon cases. / Anbarci, Nejat; Rong, Kang; Roy, Jaideep.

In: Economic Theory, Vol. 68, No. 1, 01.07.2019, p. 21-52.

Research output: Contribution to journalArticle

@article{c30cd5e7e7e34fdbbd01b61dd0b09f7a,
title = "Random-settlement arbitration and the generalized Nash solution:: one-shot and infinite-horizon cases",
abstract = "We study bilateral bargaining {\'a} la Nash (Econometrica 21:128–140, 1953) but where players face two sources of uncertainty when demands are mutually incompatible. First, there is complete breakdown of negotiations with players receiving zero payoffs, unless with probability p, an arbiter is called upon to resolve the dispute. The arbiter uses the final-offer-arbitration mechanism whereby one of the two incompatible demands is implemented. Second, the arbiter may have a preference bias toward satisfying one of the players that is private information to the arbiter and players commonly believe that the favored party is player 1 with probability q. Following Nash’s idea of ‘smoothing,’ we assume that 1 - p is larger for larger incompatibility of demands. We provide a set of conditions on p such that, as p becomes arbitrarily small, all equilibrium outcomes converge to the Nash solution outcome if q= 1 / 2 , that is when the uncertainty regarding the arbiter’s bias is maximum. Moreover, with q≠ 1 / 2 , convergence is obtained on a special point in the bargaining set that, independent of the nature of the set, picks the generalized Nash solution with as-if bargaining weights q and 1 - q. We then extend these results to infinite-horizon where instead of complete breakdown, players are allowed to renegotiate.",
keywords = "Arbitration with unknown bias, Incompatible demands, Nash bargaining, Nash solution, Random settlement",
author = "Nejat Anbarci and Kang Rong and Jaideep Roy",
year = "2019",
month = "7",
day = "1",
doi = "10.1007/s00199-018-1111-2",
language = "English",
volume = "68",
pages = "21--52",
journal = "Economic Theory",
issn = "0938-2259",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Random-settlement arbitration and the generalized Nash solution:

T2 - one-shot and infinite-horizon cases

AU - Anbarci, Nejat

AU - Rong, Kang

AU - Roy, Jaideep

PY - 2019/7/1

Y1 - 2019/7/1

N2 - We study bilateral bargaining á la Nash (Econometrica 21:128–140, 1953) but where players face two sources of uncertainty when demands are mutually incompatible. First, there is complete breakdown of negotiations with players receiving zero payoffs, unless with probability p, an arbiter is called upon to resolve the dispute. The arbiter uses the final-offer-arbitration mechanism whereby one of the two incompatible demands is implemented. Second, the arbiter may have a preference bias toward satisfying one of the players that is private information to the arbiter and players commonly believe that the favored party is player 1 with probability q. Following Nash’s idea of ‘smoothing,’ we assume that 1 - p is larger for larger incompatibility of demands. We provide a set of conditions on p such that, as p becomes arbitrarily small, all equilibrium outcomes converge to the Nash solution outcome if q= 1 / 2 , that is when the uncertainty regarding the arbiter’s bias is maximum. Moreover, with q≠ 1 / 2 , convergence is obtained on a special point in the bargaining set that, independent of the nature of the set, picks the generalized Nash solution with as-if bargaining weights q and 1 - q. We then extend these results to infinite-horizon where instead of complete breakdown, players are allowed to renegotiate.

AB - We study bilateral bargaining á la Nash (Econometrica 21:128–140, 1953) but where players face two sources of uncertainty when demands are mutually incompatible. First, there is complete breakdown of negotiations with players receiving zero payoffs, unless with probability p, an arbiter is called upon to resolve the dispute. The arbiter uses the final-offer-arbitration mechanism whereby one of the two incompatible demands is implemented. Second, the arbiter may have a preference bias toward satisfying one of the players that is private information to the arbiter and players commonly believe that the favored party is player 1 with probability q. Following Nash’s idea of ‘smoothing,’ we assume that 1 - p is larger for larger incompatibility of demands. We provide a set of conditions on p such that, as p becomes arbitrarily small, all equilibrium outcomes converge to the Nash solution outcome if q= 1 / 2 , that is when the uncertainty regarding the arbiter’s bias is maximum. Moreover, with q≠ 1 / 2 , convergence is obtained on a special point in the bargaining set that, independent of the nature of the set, picks the generalized Nash solution with as-if bargaining weights q and 1 - q. We then extend these results to infinite-horizon where instead of complete breakdown, players are allowed to renegotiate.

KW - Arbitration with unknown bias

KW - Incompatible demands

KW - Nash bargaining

KW - Nash solution

KW - Random settlement

UR - http://www.scopus.com/inward/record.url?scp=85044022617&partnerID=8YFLogxK

U2 - 10.1007/s00199-018-1111-2

DO - 10.1007/s00199-018-1111-2

M3 - Article

VL - 68

SP - 21

EP - 52

JO - Economic Theory

JF - Economic Theory

SN - 0938-2259

IS - 1

ER -