Abstract

 
 

References (46)



 


 



Sweet Talk: A Theory of Persuasion


Marco Di Maggio


Massachusetts Institute of Technology (MIT)

November 15, 2009


Abstract:     
This paper introduces a model of sweet talk in which a seller may acquire verifiable information and selectively disclose it to a buyer to negotiate a deal. We start by analyzing a model with common priors in which the seller generates information for two reasons: a trading motive and a profit motive that is, to make trade possible or to increase the gains from it. There exists a negotiation region in which the seller continues to reveal information even if trading is already profitable. We extend the model, allowing for different prior beliefs about the value of the object, arguing that a complementarity between the seller's confidence and the precision of his information endogenously arises. Appointing an optimistic salesman may be costly because he may destroy profitable trading opportunities. We also allow the seller to choose in which market to trade: a matching market with a fixed price or a haggling market. Our model also provides a testable difference between a model of trading with homogenous priors and one with heterogeneous priors and finds application in understanding contracts as reference points.

Keywords: persuasion games, haggling, heterogeneous priors, overconfidence, consummate and perfunctory performance

JEL Classification: D82, D83, D86

working papers series


Date posted: November 16, 2009 ; Last revised: October 22, 2012

Suggested Citation

Di Maggio, Marco, Sweet Talk: A Theory of Persuasion (November 15, 2009). Available at SSRN: http://ssrn.com/abstract=1506663

Contact Information

Marco Di Maggio (Contact Author)
Massachusetts Institute of Technology (MIT) ( email )
77 Massachusetts Avenue
50 Memorial Drive
Cambridge, MA 02139-4307
United States
HOME PAGE: http://econ-www.mit.edu/grad/dimaggio
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 404

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo6 in 0.328 seconds