2008
DOI: 10.1111/j.0741-6261.2008.00009.x
|View full text |Cite
|
Sign up to set email alerts
|

Efficient partnership dissolution under buy-sell clauses

Abstract: Buy

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
15
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
9

Relationship

1
8

Authors

Journals

citations
Cited by 19 publications
(15 citation statements)
references
References 12 publications
0
15
0
Order By: Relevance
“…McAfee (1992) and Cramton, Gibbons, and Klemperer (1987) explore alternative partnership dissolution mechanisms, such as a simultaneous sealed‐bid auction where the partner with the high bid gets the partnership asset at a price equal to a predetermined combination of the two bids 14 . In a recent theoretical work, de Frutos and Kittsteiner (2008) argue that the inefficiency of buy‐sell mechanisms (McAfee, 1992) is mitigated if the parties bid to determine the offeror. Jehiel and Pauzner (2006) and Fieseler, Kittsteines, and Moldovanu (2003) analyze the partnership dissolution problem in settings characterized by interdependent values and asymmetric information.…”
Section: Introductionmentioning
confidence: 99%
“…McAfee (1992) and Cramton, Gibbons, and Klemperer (1987) explore alternative partnership dissolution mechanisms, such as a simultaneous sealed‐bid auction where the partner with the high bid gets the partnership asset at a price equal to a predetermined combination of the two bids 14 . In a recent theoretical work, de Frutos and Kittsteiner (2008) argue that the inefficiency of buy‐sell mechanisms (McAfee, 1992) is mitigated if the parties bid to determine the offeror. Jehiel and Pauzner (2006) and Fieseler, Kittsteines, and Moldovanu (2003) analyze the partnership dissolution problem in settings characterized by interdependent values and asymmetric information.…”
Section: Introductionmentioning
confidence: 99%
“…Summing these two expressions gives BS(r). 19 Other simple mechanisms that dissolve a partnership efficiently under one-dimensional private information, that is, k-double auction in CGK, Moldovanu (2002), and Kittsteiner (2003), Texas shout-out mechanism in McAfee (1992) and de Frutos and Kittsteiner (2008), and winner or loser bid auctions in McAfee (1992) and Lengwiler and Wolfstetter (2005), cannot be readily extended to dissolve efficiently under the multidimensional private information in this article. be the highest bid, b i = max j =i {b j } the highest bid of the others but i, and a i = j =i a j the sum of the asks of the others but i.…”
Section: Double Auction For Partnership Dissolutionmentioning
confidence: 99%
“…Other simple mechanisms that dissolve a partnership efficiently under one‐dimensional private information, that is, k ‐double auction in CGK, Moldovanu (), and Kittsteiner (), Texas shout‐out mechanism in McAfee () and de Frutos and Kittsteiner (), and winner or loser bid auctions in McAfee () and Lengwiler and Wolfstetter (), cannot be readily extended to dissolve efficiently under the multidimensional private information in this article.…”
mentioning
confidence: 99%
“…Dissolution mechanisms used in practice typically have simpler rules than the optimal direct mechanisms we characterize. For example, in the Texas shootout (or buy–sell clause), a commonly used procedure for breaking up bilateral business partnerships, one partner proposes a per‐unit price and the other partner decides whether to sell his share or buy out his partner at that price (McAfee 1992, de Frutos and Kittsteiner 2008, Brooks et al 2010). Under private information, the Texas shootout is typically inefficient, even in settings where ex post efficient dissolution would be feasible.…”
Section: Optimal Dissolution Mechanismsmentioning
confidence: 99%