<?xml version="1.0" encoding="UTF-8"?><rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcq="http://purl.org/dc/terms/"><records count="1" morepages="false" start="1" end="1"><record rownumber="1"><dc:product_type>Conference Paper</dc:product_type><dc:title>Data-driven Contract Design</dc:title><dc:creator>Venkitasubramaniam, Parv; Gupta, Vijay</dc:creator><dc:corporate_author/><dc:editor/><dc:description>We consider a game in which one player (the principal) seeks to incentivize another player (the agent) to exert effort that is costly to the agent. Any effort exerted leads to an outcome that is a stochastic function of the effort. The amount of effort exerted by the agent is private information for the agent and the principal observes only the outcome; thus, the agent can misreport his effort to gain higher payment. Further, the cost function of the agent is also unknown to the principal and the agent can also misreport a higher cost function to gain higher payment for the same effort. We pose the problem as one of contract design when both adverse selection and moral hazard are present. We show that if the principal and agent interact only finitely many times, it is always possible for the agent to lie due to the asymmetric information pattern and claim a higher payment than if he were unable to lie. However, if the principal and agent interact infinitely many times, then the principal can utilize the observed outcomes to update the contract in a manner that reveals the private cost function of the agent and hence leads to the agent not being able to derive any rent. The result can also be interpreted as saying that the agent is unable to keep his information private if he interacts with the principal sufficiently often.</dc:description><dc:publisher/><dc:date>2019-01-01</dc:date><dc:nsf_par_id>10109193</dc:nsf_par_id><dc:journal_name>American Control Conference 2019</dc:journal_name><dc:journal_volume/><dc:journal_issue/><dc:page_range_or_elocation/><dc:issn/><dc:isbn/><dc:doi>https://doi.org/</dc:doi><dcq:identifierAwardId>1739295</dcq:identifierAwardId><dc:subject/><dc:version_number/><dc:location/><dc:rights/><dc:institution/><dc:sponsoring_org>National Science Foundation</dc:sponsoring_org></record></records></rdf:RDF>