|
||||
|
||||
Why Nuclear Disarmament May be Easier to Achieve than an End to Partisan Conflict over Judicial AppointmentsDavid S. LawWashington University in Saint Louis - School of Law; Washington University in Saint Louis - Department of Political Science Sanford LevinsonUniversity of Texas Law School University of Richmond Law Review, Vol. 39, p. 923, 2005 U of Texas Law, Public Law Research Paper No. 111 San Diego Legal Studies Paper No. 07-80 Abstract: What do nuclear competition and federal judicial selection share in common? Both involve strategic interactions that lend themselves to analysis from the perspective of game theory. From such a perspective, we offer an explanation of why partisan conflict and gridlock over appointments to the federal bench is likely to remain intractable. Game theory teaches us that, whether the game is one of nuclear disarmament or judicial selection, the prospects for long-term cooperation depend upon the ability of the players to detect uncooperative behavior and to retaliate promptly. To an unusual degree, the process by which federal judges are appointed is characterized by obstacles to effective retaliation that make enduring cooperation difficult to achieve. As a result, agreements between Republicans and Democrats over the treatment of judicial nominees may be even harder to enforce than agreements between competing superpowers to reduce their nuclear stockpiles. We conclude by discussing the conditions under which strategically minded political actors might choose to pursue the "nuclear option," by which a simple majority vote of the Senate would end the use of filibusters against judicial nominees.
Number of Pages in PDF File: 26 Keywords: judicial appointments, judicial selection, judicial behavior, federal courts, prisoner's dilemma, game theory, nuclear option, federal judiciary, filibuster Accepted Paper SeriesDate posted: November 2, 2006Suggested CitationContact Information
|
|
||||||||||||||||
© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was processed by apollo2 in 0.609 seconds