Yokote, Koji (2018): The discrete KuhnTucker theorem and its application to auctions.
This is the latest version of this item.

PDF
MPRA_paper_83811.pdf Download (277kB)  Preview 
Abstract
Using a notion of convexity in discrete convex analysis, we introduce a discrete analogue of the KuhnTucker theorem. We apply it to an auction model and show that existing iterative auctions can be viewed as the process of finding a saddle point of the Lagrange function.
Item Type:  MPRA Paper 

Original Title:  The discrete KuhnTucker theorem and its application to auctions 
Language:  English 
Keywords:  Auctions; Discrete convex analysis; KuhnTucker theorem 
Subjects:  C  Mathematical and Quantitative Methods > C7  Game Theory and Bargaining Theory > C78  Bargaining Theory ; Matching Theory D  Microeconomics > D4  Market Structure, Pricing, and Design > D44  Auctions 
Item ID:  95122 
Depositing User:  Koji Yokote 
Date Deposited:  14 Jul 2019 07:57 
Last Modified:  07 Oct 2019 04:57 
References:  Ausubel, L. M. (2006). An efficient dynamic auction for heterogeneous commodities. The American economic review, 96(3), 602629. Budish, E., Che, Y. K., Kojima, F., & Milgrom, P. (2013). Designing random allocation mechanisms: Theory and applications. The American Economic Review, 103(2), 585623. Cramton, P., Shoham, Y., & Steinber, R. (2006). Combinatorial auctions. MIT press, Cambridge Fujishige, S., & Tamura, A. (2007). A twosided discreteconcave market with possibly bounded side payments: An approach by discrete convex analysis. Mathematics of Operations Research, 32(1), 136155. Fujishige, S., & Yang, Z. (2003). A note on Kelso and Crawford's gross substitutes condition. Mathematics of Operations Research, 28(3), 463469. Gul, F., & Stacchetti, E. (1999). Walrasian equilibrium with gross substitutes. Journal of Economic theory, 87(1), 95124. HiriartUrruty, J.B., Lemarechal, C. (2001). Fundamentals of convex analysis. Springer. Kelso Jr, A. S., & Crawford, V. P. (1982). Job matching, coalition formation, and gross substitutes. Econometrica: Journal of the Econometric Society, 14831504. Kojima, F. (2015). Recent developments in matching theory and its practical applications.Advances in Economics and Econometrics; 11th world congress of Econometric Society. Kojima, F., Tamura, A., & Yokoo, M. (2017). Designing matching mechanisms under constraints: An approach from discrete convex analysis. MPRA paper No. 78637. Murota, K. (2003). Discrete convex analysis. SIAM. Murota, K., Shioura, A., & Yang, Z. (2016). Time bounds for iterative auctions: a unified approach by discrete convex analysis. discrete optimization, 19, 3662. Rockafellar, R. T. (1970). Convex analysis. Princeton University Press. Roth, A. E., & Sotomayor, M. (1990). Twosided matching: a study in gametheoretic modeling and analysis. Cambridge University Press, Cambridge. Tiel, J. v., 1984. Convex analysis: An introductory text. John Wiley. 
URI:  https://mpra.ub.unimuenchen.de/id/eprint/95122 
Available Versions of this Item

The discrete KuhnTucker theorem and its application to auctions. (deposited 10 Jan 2018 14:20)
 The discrete KuhnTucker theorem and its application to auctions. (deposited 14 Jul 2019 07:57) [Currently Displayed]