|
||||
|
||||
Divide and ConquerEric A. PosnerUniversity of Chicago - Law School Kathryn E. SpierHarvard University - Law School - Faculty; National Bureau of Economic Research (NBER) Adrian VermeuleHarvard Law School May 26, 2009 U of Chicago Law & Economics, Olin Working Paper No. 467 Harvard Public Law Working Paper No. 09-24 Harvard Law and Economics Discussion Paper No. 639 Abstract: The maxim “divide and conquer” (divide et impera) is frequently invoked in legal theory and the social sciences. We suggest that the maxim is a placeholder for a complex of ideas related by a family resemblance, but differing in their details, mechanisms and implications. We provide an analytic taxonomy of divide and conquer mechanisms in the settings of a Stag Hunt Game and an indefinitely-repeated Prisoners’ Dilemma. These two games both illustrate a tension between the social desirability of cooperation and the private incentives for safety and short-run gains. Next, we describe the role of third parties who are not themselves players of these games but who will be harmed if the players cooperate. In particular, we explore a variety of divide-and-conquer strategies – including the sabotage of communication channels, the payment of bribes, and the imposition of penalties – that effectively prevent cooperation among the players of these games. A number of applications are considered, including labor law, constitutional design and the separation of powers, imperialism and race relations, international law, litigation and settlement, and antitrust law. Conditions under which divide and conquer strategies reduce or enhance social welfare, and techniques that policy makers can use to combat divide and conquer tactics, are also discussed.
Number of Pages in PDF File: 45 working papers seriesDate posted: June 5, 2009 ; Last revised: June 17, 2010Suggested CitationContact Information
|
|
|||||||||||||||||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo4 in 0.516 seconds