Footnotes (106)



Fixing Unfair Contracts

Omri Ben-Shahar

University of Chicago Law School

May 6, 2011

Stanford Law Review, Vol. 63, 2011
U of Chicago Law & Economics, Olin Working Paper No. 552

Various doctrines of contract and consumer protection law allow courts to strike down unfair contract terms. A large literature has explored the question which terms should be viewed as unfair, but a related question has never been studied systematically – what provision should replace the vacated unfair term? How should a distributively unfair contract be fixed? This Article demonstrates that the law uses three competing criteria for a replacement provision: (1) the most reasonable term; (2) a punitive term, strongly unfavorable to the overreaching party; and (3) the minimally tolerable term, which preserves the original term as much as is tolerable. The Article explores in depth the third criterion – the minimally tolerable term – under which the smallest intervention that is necessary is applied. This criterion, which has received no prior scholarly notice, is surprisingly prevalent in legal doctrine. The Article surveys its ubiquity and explores its conceptual and normative underpinnings.

Number of Pages in PDF File: 38

Open PDF in Browser Download This Paper

Date posted: May 10, 2011 ; Last revised: June 25, 2013

Suggested Citation

Ben-Shahar, Omri, Fixing Unfair Contracts (May 6, 2011). Stanford Law Review, Vol. 63, 2011; U of Chicago Law & Economics, Olin Working Paper No. 552. Available at SSRN: http://ssrn.com/abstract=1833824

Contact Information

Omri Ben-Shahar (Contact Author)
University of Chicago Law School ( email )
1111 E. 60th St.
Chicago, IL 60637
United States
Feedback to SSRN

Paper statistics
Abstract Views: 1,294
Downloads: 318
Download Rank: 64,646
Footnotes:  106
Paper comments
No comments have been made on this paper

© 2016 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright   Contact Us
This page was processed by apollobot1 in 0.234 seconds