Bargaining with nonanonymous disagreement: Decomposable rules

No Thumbnail Available

Date

2011

Authors

Kıbrıs, Özgür
Tapkı, İpek Gürsel

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier Science Bv

Research Projects

Organizational Units

Journal Issue

Abstract

We analyze bargaining situations where the agents' payoffs from disagreement depend on who among them breaks down the negotiations. We model such problems as a superset of the standard domain of Nash (1950). We first show that this domain extension creates a very large number of new rules. In particular, decomposable rules (which are extensions of rules from the Nash domain) constitute a nowhere dense subset of all possible rules. For them, we analyze the process through which "good" properties of rules on the Nash domain extend to ours. We then enquire whether the counterparts of some well-known results on the Nash (1950) domain continue to hold for decomposable rules on our extended domain. We first show that an extension of the Kalai-Smorodinsky bargaining rule uniquely satisfies the Kalai and Smorodinsky (1975) properties. This uniqueness result, however, turns out to be an exception. We characterize the uncountably large classes of decomposable rules that survive the Nash (1950), Kalai (1977), and Thomson (1981) properties. (C) 2011 Elsevier B.V. All rights reserved.

Description

Keywords

Point, Nash, Axioms, Model

Turkish CoHE Thesis Center URL

Citation

2

WoS Q

Q4

Scopus Q

Q2

Source

Volume

62

Issue

3

Start Page

151

End Page

161