×

On incentive compatibility in dynamic mechanism design with exit option in a Markovian environment. (English) Zbl 1494.91034

Summary: This paper studies dynamic mechanism design in a Markovian environment and analyzes a direct mechanism model of a principal-agent framework in which the agent is allowed to exit at any period. We consider that the agent’s private information, referred to as state, evolves over time. The agent makes decisions of whether to stop or continue and what to report at each period. The principal, on the other hand, chooses decision rules consisting of an allocation rule and a set of payment rules to maximize her ex-ante expected payoff. In order to influence the agent’s stopping decision, one of the terminal payment rules is posted-price, i.e., it depends only on the realized stopping time of the agent. This work focuses on the theoretical design regime of the dynamic mechanism design when the agent makes coupled decisions of reporting and stopping. A dynamic incentive compatibility constraint is introduced to guarantee the robustness of the mechanism to the agent’s strategic manipulation. A sufficient condition for dynamic incentive compatibility is obtained by constructing the payment rules in terms of a set of functions parameterized by the allocation rule. The payment rules are then pinned down up to a constant in terms of the allocation rule by deriving a first-order condition. We show cases of relaxations of the principal’s mechanism design problem and provide an approach to evaluate the loss of robustness of the dynamic incentive compatibility when the problem solving is relaxed due to analytical intractability. A case study is used to illustrate the theoretical results.

MSC:

91B03 Mechanism design theory
91B43 Principal-agent models
60G40 Stopping times; optimal stopping problems; gambling theory

References:

[1] Akan, M.; Ata, B.; Dana, JD Jr, Revenue management by sequential screening, J Econ Theory, 159, 728-774 (2015) · Zbl 1330.91078
[2] Akbarpour, M.; Li, S.; Gharan, SO, Thickness and information in dynamic matching markets, J Political Econ, 128, 3, 783-815 (2020)
[3] Anderson, A.; Smith, L., Dynamic matching and evolving reputations, Rev Econ Stud, 77, 1, 3-29 (2010) · Zbl 1197.91152
[4] Ano K (2009) Optimal stopping problem with uncertain stopping and its application to discrete options. In Presented at the 2nd Symposium on Optimal Stopping with Applications
[5] Ash, RB, Real analysis and probability: probability and mathematical statistics: a series of monographs and textbooks (2014), Cambridge: Academic press, Cambridge
[6] Athey, S.; Segal, I., An efficient dynamic mechanism, Econometrica, 81, 6, 2463-2485 (2013) · Zbl 1304.91080
[7] Azevedo, EM; Budish, E., Strategy-proofness in the large, Rev Econ Stud, 86, 1, 81-116 (2019) · Zbl 1409.91115
[8] Bapna A, Weber TA (2005) Efficient dynamic allocation with uncertain valuations. Available at SSRN 874770
[9] Baron, DP; Besanko, D., Regulation and information in a continuing relationship, Inf Econ Policy, 1, 3, 267-302 (1984)
[10] Bergemann, D.; Välimäki, J., The dynamic pivot mechanism, Econometrica, 78, 2, 771-789 (2010) · Zbl 1229.91206
[11] Berger A, Müller R, Naeemi SH (2010) Path-monotonicity and truthful implementation. Technical Report 603, Maastricht University
[12] Blackwell, D., Discounted dynamic programming, Annal Math Stat, 36, 1, 226-235 (1965) · Zbl 0133.42805
[13] Blasques, F.; Koopman, SJ; Lucas, A., Nonlinear autoregressive models with optimality properties, Econ Rev, 39, 6, 559-578 (2020) · Zbl 1490.62421
[14] Board, S.; Skrzypacz, A., Revenue management with forward-looking buyers, J Polit Econ, 124, 4, 1046-1087 (2016)
[15] Courty, P.; Hao, L., Sequential screening, Rev Econ Stud, 67, 4, 697-717 (2000) · Zbl 0977.91028
[16] Deb, R.; Said, M., Dynamic screening with limited commitment, J Econ Theory, 159, 891-928 (2015) · Zbl 1330.91093
[17] Dubins, LE; Sudderth, WD, Countably additive gambling and optimal stopping, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 41, 1, 59-72 (1977) · Zbl 0349.60049
[18] Eső, P.; Szentes, B., Optimal information disclosure in auctions and the handicap auction, Rev Econ Stud, 74, 3, 705-731 (2007) · Zbl 1171.91012
[19] Findeisen, S.; Sachs, D., Education and optimal dynamic taxation: the role of income-contingent student loans, J Public Econ, 138, 1-21 (2016)
[20] Fudenberg, D.; Tirole, J., Game theory (1991), Cambridge: MIT Press, Cambridge · Zbl 1339.91001
[21] Gallien, J., Dynamic mechanism design for online commerce, Oper Res, 54, 2, 291-310 (2006) · Zbl 1167.91346
[22] Gershkov, A.; Moldovanu, B., Dynamic revenue maximization with heterogeneous objects: a mechanism design approach, Am Econ J Microecon, 1, 2, 168-98 (2009)
[23] He, XD; Hu, S.; Obłój, J.; Zhou, XY, Optimal exit time from casino gambling: Strategies of precommitted and naive gamblers, SIAM J Control Optim, 57, 3, 1845-1868 (2019) · Zbl 1422.91482
[24] Jacka, S.; Lynn, J., Finite-horizon optimal stopping, obstacle problems and the shape of the continuation region, Stochast Stochast Rep, 39, 1, 25-42 (1992) · Zbl 0793.60045
[25] Kakade, SM; Lobel, I.; Nazerzadeh, H., Optimal dynamic mechanism design and the virtual-pivot mechanism, Oper Res, 61, 4, 837-854 (2013) · Zbl 1291.91082
[26] Kruse, T.; Strack, P., Optimal stopping with private information, J Econ Theory, 159, 702-727 (2015) · Zbl 1330.91099
[27] Kruse, T.; Strack, P., An inverse optimal stopping problem for diffusion processes, Math Operat Res, 44, 2, 423-439 (2018) · Zbl 1443.91199
[28] Lamberton D, et al. (2009) Optimal stopping and american options. Ljubljana Summer School on Financial Mathematics, p 134 · Zbl 1181.60063
[29] Li, S.; Yılmaz, Y.; Wang, X., Quickest detection of false data injection attack in wide-area smart grids, IEEE Trans Smart Grid, 6, 6, 2725-2735 (2014)
[30] Lin W-Y, Lin G-Y, Wei H-Y (2010) Dynamic auction mechanism for cloud resource allocation. In: Proceedings of the 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, pp 591-592. IEEE Computer Society
[31] Lovász L, Winkler P (1995) Efficient stopping rules for markov chains. In: Proceedings of the 27th annual ACM symposium on Theory of computing, pp 76-82 · Zbl 0921.60062
[32] Lubin, B.; Parkes, DC, Approximate strategyproofness, Current Sci, 103, 9, 1021-1032 (2012)
[33] Lundgren, R.; Silvestrov, DS; Rykov, V.; Balakrishnan, N.; Nikulin, M., Optimal stopping and reselling of european options, Mathematical and statistical models and methods in reliability, 371-389 (2010), Berlin: Springer, Berlin · Zbl 1405.91641
[34] Makris M, Pavan A (2021) Taxation under learning-by-doing. J Political Econ (in press)
[35] Myerson, RB, Optimal auction design, Math Oper Res, 6, 1, 58-73 (1981) · Zbl 0496.90099
[36] Nazerzadeh, H.; Saberi, A.; Vohra, R., Dynamic pay-per-action mechanisms and applications to online advertising, Oper Res, 61, 1, 98-111 (2013) · Zbl 1268.91091
[37] Pai, MM; Vohra, R., Optimal dynamic auctions and simple index rules, Math Oper Res, 38, 4, 682-697 (2013) · Zbl 1297.91085
[38] Parkes, DC; Nisan, N.; Roughgarden, T.; Tardos, E.; Vazirani, VV, Online mechanisms, Algorithmic game theory, 411-440 (2007), Cambridge: Cambridge University Press, Cambridge · Zbl 1130.91005
[39] Parkes DC, Singh S (2003) An mdp-based approach to online mechanism design. In: Proceedings of the 16th international conference on neural information processing systems, pp 791-798
[40] Pathak, PA; Sönmez, T., Leveling the playing field: sincere and sophisticated players in the boston mechanism, Am Econ Rev, 98, 4, 1636-52 (2008)
[41] Pavan A, Segal I, Toikka J (May 2009) Dynamic mechanism design: Incentive compatibility, profit maximization and information disclosure. Discussion Papers 1501, Northwestern University, Center for Mathematical Studies in Economics and Management Science
[42] Pavan, A.; Segal, I.; Toikka, J., Dynamic mechanism design: a myersonian approach, Econometrica, 82, 2, 601-653 (2014) · Zbl 1419.91147
[43] Peng G, Zhu Q (2020) Sequential hypothesis testing game. In Proceedings of the 54th annual conference on information sciences and systems (CISS), IEEE, pp 1-6
[44] Peskir, G.; Shiryaev, A., Optimal stopping and free-boundary problems (2006), Basel: Birkhäuser, Basel · Zbl 1115.60001
[45] Quah, JK-H; Strulovici, B., Aggregating the single crossing property, Econometrica, 80, 5, 2333-2348 (2012) · Zbl 1274.91126
[46] Rochet, J-C, A necessary and sufficient condition for rationalizability in a quasi-linear context, J Math Econ, 16, 2, 191-200 (1987) · Zbl 0628.90003
[47] Rogerson, WP, The first-order approach to principal-agent problems, Econometrica, 53, 6, 1357-1367 (1985) · Zbl 0576.90005
[48] Said, M., Auctions with dynamic populations: efficiency and revenue maximization, J Econ Theory, 147, 6, 2419-2438 (2012) · Zbl 1260.91113
[49] Salacuse JW (2000) Renegotiating international project agreements. Fordham Int’l L.J., 24:1319
[50] Tadelis S, Segal I (2005) Lectures in contract theory. Lecture notes for UC Berkeley and Stanford University
[51] Tartakovsky, AG; Veeravalli, VV, Asymptotically optimal quickest change detection in distributed sensor systems, Sequential Anal, 27, 4, 441-475 (2008) · Zbl 1247.93014
[52] Vickrey, W., Counterspeculation, auctions, and competitive sealed tenders, J Finance, 16, 1, 8-37 (1961)
[53] Villeneuve, S., On threshold strategies and the smooth-fit principle for optimal stopping problems, J Appl Probability, 44, 1, 181-198 (2007) · Zbl 1134.60338
[54] Vulcano, G.; Van Ryzin, G.; Maglaras, C., Optimal dynamic auctions for revenue management, Manage Sci, 48, 11, 1388-1407 (2002) · Zbl 1232.91333
[55] Williams, N., Persistent private information, Econometrica, 79, 4, 1233-1275 (2011) · Zbl 1252.91057
[56] Zhang W (2012) Endogenous preferences and dynamic contract design. The B.E. J Theor Econ, vol 12, no 1 · Zbl 1277.91113
[57] Zhang, Y., Dynamic contracting with persistent shocks, J Econ Theory, 144, 2, 635-675 (2009) · Zbl 1157.91405
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.