IDEAS home Printed from https://ideas.repec.org/p/hhs/lunewp/2015_019.html
   My bibliography  Save this paper

An Approximate Auction

Author

Listed:

Abstract

This paper presents an auction procedure which is of particular interest when short execution times are of importance. It is based on a method for approximating the bidders' preferences over two types of items when complementarity between the two may exist. In particular, linear approximations of the bidders' indifference curves are made. The resulting approximated preference relation is shown to be complete and transitive at any given price vector. It is shown that an approximated Walrasian equilibrium always exists if the approximated preferences of the bidders comply with the gross substitutes condition. Said condition also ensures that the set of approximated equilibrium prices forms a complete lattice. A process is proposed which is shown to always reach the smallest approximated Walrasian price vector.

Suggested Citation

  • Ingebretsen Carlson, Jim, 2015. "An Approximate Auction," Working Papers 2015:19, Lund University, Department of Economics.
    • Handle: RePEc:hhs:lunewp:2015_019
    as

    Download full text from publisher

    File URL: http://project.nek.lu.se/publications/workpap/papers/wp15_19.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. T. Andersson & C. Andersson & A. Talman, 2013. "Sets in excess demand in simple ascending auctions with unit-demand bidders," Annals of Operations Research, Springer, vol. 211(1), pages 27-36, December.
    2. Ken Binmore & Paul Klemperer, 2002. "The Biggest Auction Ever: the Sale of the British 3G Telecom Licences," Economic Journal, Royal Economic Society, vol. 112(478), pages 74-96, March.
    3. Matthews, Steven, 1987. "Comparing Auctions for Risk Averse Buyers: A Buyer's Point of View," Econometrica, Econometric Society, vol. 55(3), pages 633-646, May.
    4. Ning Sun & Zaifu Yang, 2006. "Equilibria and Indivisibilities: Gross Substitutes and Complements," Econometrica, Econometric Society, vol. 74(5), pages 1385-1402, September.
    5. Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Other publications TiSEM c7482a22-cb73-428b-9cc0-e, Tilburg University, School of Economics and Management.
    6. Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Springer;Society for Computational Economics, vol. 33(4), pages 389-401, May.
    7. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    8. Paul Klemperer, 2010. "The Product-Mix Auction: A New Auction Design for Differentiated Goods," Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 526-536, 04-05.
    9. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-872, August.
    10. Mishra, Debasis & Talman, Dolf, 2010. "Characterization of the Walrasian equilibria of the assignment model," Journal of Mathematical Economics, Elsevier, vol. 46(1), pages 6-20, January.
    11. Lawrence M. Ausubel, 2004. "An Efficient Ascending-Bid Auction for Multiple Objects," American Economic Review, American Economic Association, vol. 94(5), pages 1452-1475, December.
    12. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    13. Sankaran, Jayaram K., 1994. "On a dynamic auction mechanism for a bilateral assignment problem," Mathematical Social Sciences, Elsevier, vol. 28(2), pages 143-150, October.
    14. Paul Milgrom, 2000. "Putting Auction Theory to Work: The Simultaneous Ascending Auction," Journal of Political Economy, University of Chicago Press, vol. 108(2), pages 245-272, April.
    15. Ning Sun & Zaifu Yang, 2009. "A Double-Track Adjustment Process for Discrete Markets With Substitutes and Complements," Econometrica, Econometric Society, vol. 77(3), pages 933-952, May.
    16. Albin Erlanson, 2014. "The Duo-Item Bisection Auction," Computational Economics, Springer;Society for Computational Economics, vol. 43(1), pages 15-31, January.
    17. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ingebretsen Carlson, Jim, 2016. "An Auction with Approximated Bidder Preferences - When an Auction has to be Quick," Working Papers 2016:12, Lund University, Department of Economics.
    2. Jim Ingebretsen Carlson, 2020. "A speedy auction using approximated bidders’ preferences," Annals of Operations Research, Springer, vol. 288(1), pages 65-93, May.
    3. Andersson, Tommy & Yang, Zaifu & Zhang, Dongmo, 2015. "How to efficiently allocate houses under price controls?," Economics Letters, Elsevier, vol. 130(C), pages 97-99.
    4. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    5. A. Talman & Zaifu Yang, 2015. "An efficient multi-item dynamic auction with budget constrained bidders," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 769-784, August.
    6. Satoru Fujishige & Zaifu Yang, 2020. "A Universal Dynamic Auction for Unimodular Demand Types: An Efficient Auction Design for Various Kinds of Indivisible Commodities," Discussion Papers 20/08, Department of Economics, University of York.
    7. Satoru Fujishige & Zaifu Yang, 2017. "On a spontaneous decentralized market process," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 1-37, December.
    8. Kazuo Murota & Akiyoshi Shioura & Zaifu Yang, 2014. "Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis," Discussion Papers 14/27, Department of Economics, University of York.
    9. Kazuo Murota, 2016. "Discrete convex analysis: A tool for economics and game theory," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 151-273, December.
    10. Gerard van der Laan & Zaifu Yang, 2016. "An ascending multi-item auction with financially constrained bidders," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 1(1), pages 109-149, December.
    11. Alexander Teytelboym & Shengwu Li & Scott Duke Kominers & Mohammad Akbarpour & Piotr Dworczak, 2021. "Discovering Auctions: Contributions of Paul Milgrom and Robert Wilson," Scandinavian Journal of Economics, Wiley Blackwell, vol. 123(3), pages 709-750, July.
    12. Talman, Dolf & Yang, Zaifu, 2011. "A model of partnership formation," Journal of Mathematical Economics, Elsevier, vol. 47(2), pages 206-212, March.
    13. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    14. Andersson, Tommy & Gudmundsson, Jens & Talman, Dolf & Yang, Zaifu, 2014. "A competitive partnership formation process," Games and Economic Behavior, Elsevier, vol. 86(C), pages 165-177.
    15. Zhou, Yu & Serizawa, Shigehiro, 2023. "Multi-object auction design beyond quasi-linearity: Leading examples," Games and Economic Behavior, Elsevier, vol. 140(C), pages 210-228.
    16. Ozan Candogan & Asuman Ozdaglar & Pablo A. Parrilo, 2015. "Iterative Auction Design for Tree Valuations," Operations Research, INFORMS, vol. 63(4), pages 751-771, August.
    17. De Liu & Adib Bagh, 2020. "Preserving Bidder Privacy in Assignment Auctions: Design and Measurement," Management Science, INFORMS, vol. 66(7), pages 3162-3182, July.
    18. Zaifu Yang & Jingsheng Yu, 2018. "Efficient Ascending Menu Auctions with Budget Constrained Bidders," Discussion Papers 18/09, Department of Economics, University of York.
    19. Akiyoshi Shioura, 2017. "On the Partnership formation problem," The Journal of Mechanism and Institution Design, Society for the Promotion of Mechanism and Institution Design, University of York, vol. 2(1), pages 105-140, December.
    20. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.

    More about this item

    Keywords

    Approximate auction; one-round auction; non-quasi-linear preferences; approximated preferences;
    All these keywords.

    JEL classification:

    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hhs:lunewp:2015_019. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Iker Arregui Alegria (email available below). General contact details of provider: https://edirc.repec.org/data/delunse.html .

    Please note that corrections may 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.