IDEAS home Printed from https://ideas.repec.org/f/pma696.html
   My authors  Follow this author

Laurent A. Mathevet

Personal Details

First Name:Laurent
Middle Name:
Last Name:Mathevet
Suffix:
RePEc Short-ID:pma696
[This author has chosen not to make the email address public]
http://www.laurentmathevet.com
Terminal Degree:2008 Division of Social Sciences; California Institute of Technology (from RePEc Genealogy)

Affiliation

Department of Economics
New York University (NYU)

New York City, New York (United States)
http://econ.as.nyu.edu
RePEc:edi:denyuus (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Elliot Lipnowski & Laurent Mathevet & Dong Wei, 2020. "Optimal Attention Management: A Tractable Framework," Papers 2006.07729, arXiv.org, revised Mar 2022.
  2. Mathevet, Laurent & Taneva, Ina, 2020. "Organized Information Transmission," MPRA Paper 104302, University Library of Munich, Germany.
  3. Laurent Mathevet & Jakub Steiner, 2012. "Sand in the Wheels: A Dynamic Global-Game Approach," CERGE-EI Working Papers wp459, The Center for Economic Research and Graduate Education - Economics Institute, Prague.
  4. Mathevet, Laurent, 2012. "Beliefs and rationalizability in games with complementarities," MPRA Paper 36032, University Library of Munich, Germany.
  5. Mathevet, Laurent, 2007. "Supermodular Bayesian implementation: Learning and incentive design," Working Papers 1265, California Institute of Technology, Division of the Humanities and Social Sciences.
  6. Jackson, Matthew O. & Mathevet, Laurent & Mattes, Kyle, "undated". "Nomination processes and policy outcomes," Working Papers 1250, California Institute of Technology, Division of the Humanities and Social Sciences.
  7. Mathevet, Laurent, "undated". "A contraction principle for finite global games," Working Papers 1243, California Institute of Technology, Division of the Humanities and Social Sciences.

Articles

  1. Laurent Mathevet & Jacopo Perego & Ina Taneva, 2020. "On Information Design in Games," Journal of Political Economy, University of Chicago Press, vol. 128(4), pages 1370-1404.
  2. Elliot Lipnowski & Laurent Mathevet & Dong Wei, 2020. "Attention Management," American Economic Review: Insights, American Economic Association, vol. 2(1), pages 17-32, March.
  3. Mathevet, Laurent, 2018. "An axiomatization of plays in repeated games," Games and Economic Behavior, Elsevier, vol. 110(C), pages 19-31.
  4. Elliot Lipnowski & Laurent Mathevet, 2018. "Disclosure to a Psychological Audience," American Economic Journal: Microeconomics, American Economic Association, vol. 10(4), pages 67-93, November.
  5. Ron Borkovsky & Paul Ellickson & Brett Gordon & Victor Aguirregabiria & Pedro Gardete & Paul Grieco & Todd Gureckis & Teck-Hua Ho & Laurent Mathevet & Andrew Sweeting, 2015. "Multiplicity of equilibria and information structures in empirical games: challenges and prospects," Marketing Letters, Springer, vol. 26(2), pages 115-125, June.
  6. Mathevet, Laurent, 2014. "Beliefs and rationalizability in games with complementarities," Games and Economic Behavior, Elsevier, vol. 85(C), pages 252-271.
  7. Mathevet, Laurent & Steiner, Jakub, 2013. "Tractable dynamic global games and applications," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2583-2619.
  8. Mathevet, Laurent & Taneva, Ina, 2013. "Finite supermodular design with interdependent valuations," Games and Economic Behavior, Elsevier, vol. 82(C), pages 327-349.
  9. , J. & ,, 2012. "Designing stable mechanisms for economic environments," Theoretical Economics, Econometric Society, vol. 7(3), September.
  10. , A., 2010. "Supermodular mechanism design," Theoretical Economics, Econometric Society, vol. 5(3), September.
  11. Laurent Mathevet, 2010. "A contraction principle for finite global games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(3), pages 539-563, March.
  12. Jackson, Matthew O. & Mathevet, Laurent & Mattes, Kyle, 2007. "Nomination Processes and Policy Outcomes," Quarterly Journal of Political Science, now publishers, vol. 2(1), pages 67-92, March.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 8 papers announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-GTH: Game Theory (5) 2005-12-14 2012-02-01 2012-05-15 2012-10-13 2021-01-25. Author is listed
  2. NEP-MIC: Microeconomics (5) 2012-02-01 2012-05-15 2012-10-13 2020-07-27 2021-01-25. Author is listed
  3. NEP-CDM: Collective Decision-Making (2) 2006-08-19 2007-03-10
  4. NEP-DES: Economic Design (2) 2020-07-27 2021-01-25
  5. NEP-CTA: Contract Theory and Applications (1) 2012-02-01
  6. NEP-MAC: Macroeconomics (1) 2006-08-19
  7. NEP-ORE: Operations Research (1) 2021-01-25

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Laurent Mathevet should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.