Job Market Paper
Is incentive compatibility still necessary for implementation if we relax the rational expectations assumption?
This paper proposes a generalized model of implementation that does not assume agents hold rational expectations and characterizes the class of solution concepts requiring Bayesian Incentive Compatibility (BIC) for full implementation. Surprisingly, for a broad class of solution concepts, full implementation of functions still requires BIC even if rational expectations do not hold. This finding implies that some classical results, such as the impossibility of efficient bilateral trade (Myerson & Satterthwaite, 1983), hold for a broader range of non-equilibrium solution concepts, confirming their relevance even in boundedly rational setups.
Paper presentations: Brown University Brown Bag Seminar (2021, 2022), Boston College Brown Bag Seminar (2022, 2023), 12th Conference on Economic Design, 16th SSCW Meeting, University of Bologna (2022), SING17, 33rd Stony Brook International Conference, 1st NSEF Worskhop, 12th Lisbon Meetings in Game Theory and Applications, 34th Stony Brook International Conference, SMYE2023.
Working Papers
The revelation principle states that it is without loss of generality to restrict attention to direct mechanisms and, consequently, that incentive compatibility is necessary for implementation. This paper extends the discussion beyond Bayesian Nash Equilibrium by providing sufficient conditions on the solution concept that ensure any implementable social choice function can be implemented via a direct mechanism. These conditions do not generally imply incentive compatibility is necessary for implementation, as the class of solution concepts requiring incentive compatibility for implementation is characterized via a logically independent condition.
Revelation Principle and Opportunity Constraints
Draft coming soon!
Draft coming soon!
In traditional mechanism design, it is assumed the planner has almost complete freedom in choosing the implementing mechanism. The paper generalizes the model by requiring the implementing mechanism to also satisfy some exogenously imposed constraints on the outcomes in each agent’s opportunity set. I discuss applications of this framework to mechanism design in network environments and to one-sided matching with priorities.
Selected Work in Progress
Iterative Reasoning through Heuristics
With G. De Clippel, R. Fonseca, K. Rozen, and P. Ortoleva.
With G. De Clippel, R. Fonseca, K. Rozen, and P. Ortoleva.