[go: up one dir, main page]

IDEAS home Printed from https://ideas.repec.org/p/sek/iacpro/9411761.html
   My bibliography  Save this paper

Heuristic and Equilibrium Strategies in Premium Auctions

Author

Listed:
  • Dejan Trifunovic

    (Faculty of Economics, University of Belgrade)

Abstract
Premium auctions are conducted in two stages. In the first stage bidders compete in English auction until two bidders remain. The two finalists enter the second stage where they compete in a first-price sealed bid auction (Amsterdam auction) or in another English auction (Antwerp auction). The winner and the runner up obtain the premium that is proportional to the difference between the runner up?s bid and the highest losing bid in the first stage. We compare the equilibrium bidding strategy of the two finalists with the three heuristic strategies when bidders have private values in Amsterdam auction. With the first heuristic strategy, each finalist believes that he will lose in the second stage and that his bid determines the amount of the premium. With the second heuristic strategy, each finalist is optimistic and has second-order belief that the other finalist is pessimistic. With the third heuristic strategy, both finalists are optimistic and have second-order belief that the other finalist is optimistic.The simulation analysis with symmetric bidders shows that the average increase of bid of the runner up relative to the equilibrium bid is the largest with the second heuristic strategy, followed by the third and the first, respectively. The premium with either heuristic strategy is larger than with the equilibrium strategy. The profit of the winner is larger than the equilibrium profit, while seller?s revenue is lower than in equilibrium. The same conclusions hold for strongly asymmetric bidders. The use of heuristic strategies could be considered as a form of tacit collusion between two finalists, and with symmetric bidders who use the first heuristic strategy, the tacit collusion is stable even in a one-shot game.

Suggested Citation

  • Dejan Trifunovic, 2019. "Heuristic and Equilibrium Strategies in Premium Auctions," Proceedings of International Academic Conferences 9411761, International Institute of Social and Economic Sciences.
  • Handle: RePEc:sek:iacpro:9411761
    as

    Download full text from publisher

    File URL: https://iises.net/proceedings/iises-international-academic-conference-paris/table-of-content/detail?cid=94&iid=035&rid=11761
    File Function: First version, 2019
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brunner, Christoph & Hu, Audrey & Oechssler, Jörg, 2014. "Premium auctions and risk preferences: An experimental study," Games and Economic Behavior, Elsevier, vol. 87(C), pages 467-484.
    2. Dutra, Joisa C. & Menezes, Flavio M., 2002. "Hybrid auctions," Economics Letters, Elsevier, vol. 77(3), pages 301-307, November.
    3. Sander Onderstal, 2020. "Premium auctions in the field," Review of Economic Design, Springer;Society for Economic Design, vol. 24(1), pages 39-63, June.
    4. Levin, Dan & Ye, Lixin, 2008. "Hybrid auctions revisited," Economics Letters, Elsevier, vol. 99(3), pages 591-594, June.
    5. Hu, Audrey & Offerman, Theo & Zou, Liang, 2011. "Premium auctions and risk preferences," Journal of Economic Theory, Elsevier, vol. 146(6), pages 2420-2439.
    6. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    7. Paul Klemperer, 2004. "Auctions: Theory and Practice," Online economics textbooks, SUNY-Oswego, Department of Economics, number auction1.
    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. Stojadinović, Nikola & Bošković, Branislav & Trifunović, Dejan & Janković, Slađana, 2019. "Train path congestion management: Using hybrid auctions for decentralized railway capacity allocation," Transportation Research Part A: Policy and Practice, Elsevier, vol. 129(C), pages 123-139.
    2. Estrella Alonso & Joaquín Sánchez-Soriano & Juan Tejada, 2020. "Mixed Mechanisms for Auctioning Ranked Items," Mathematics, MDPI, vol. 8(12), pages 1-26, December.
    3. Lorentziadis, Panos L., 2016. "Optimal bidding in auctions from a game theory perspective," European Journal of Operational Research, Elsevier, vol. 248(2), pages 347-371.
    4. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    5. Sosung Baik & Sung-Ha Hwang, 2021. "Auction design with ambiguity: Optimality of the first-price and all-pay auctions," Papers 2110.08563, arXiv.org.
    6. Sven-Olof Fridolfsson and Thomas P. Tangeras, 2015. "Nuclear Capacity Auctions," The Energy Journal, International Association for Energy Economics, vol. 0(Number 3).
    7. 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.
    8. Dejan Trifunović & Bojan Ristić, 2013. "Multi-Unit Auctions In The Procurement Of Electricity," Economic Annals, Faculty of Economics and Business, University of Belgrade, vol. 58(197), pages 47-78, April – J.
    9. Li, Zhen & Kuo, Ching-Chung, 2011. "Revenue-maximizing Dutch auctions with discrete bid levels," European Journal of Operational Research, Elsevier, vol. 215(3), pages 721-729, December.
    10. Shigeharu Okajima & Hiroko Okajima, 2016. "Impact of environmental regulation and the 2011 earthquake on the Japanese electricity industry," Journal of Regulatory Economics, Springer, vol. 49(2), pages 223-249, April.
    11. Ning Sun & Zaifu Yang, 2014. "An Efficient and Incentive Compatible Dynamic Auction for Multiple Complements," Journal of Political Economy, University of Chicago Press, vol. 122(2), pages 422-466.
    12. Yu Zhou & Shigehiro Serizawa, 2020. "Serial Vickrey Mechanism," ISER Discussion Paper 1095, Institute of Social and Economic Research, Osaka University.
    13. Isa Hafalir & Onur Kesten & Katerina Sherstyuk & Cong Tao, 2023. "When Speed is of Essence: Perishable Goods Auctions," Working Papers 202310, University of Hawaii at Manoa, Department of Economics.
    14. Onur A. Koska & Ilke Onur & Frank Stähler, 2018. "The scope of auctions in the presence of downstream interactions and information externalities," Journal of Economics, Springer, vol. 125(2), pages 107-136, October.
    15. Sweeting, Andrew & Bhattacharya, Vivek, 2015. "Selective entry and auction design," International Journal of Industrial Organization, Elsevier, vol. 43(C), pages 189-207.
    16. Li, Yunan, 2017. "Approximation in mechanism design with interdependent values," Games and Economic Behavior, Elsevier, vol. 103(C), pages 225-253.
    17. Andrey Tkachenko & Paola Valbonesi & Elena Shadrina & Gegam Shagbazian, 2019. "Efficient design of set-aside auctions for small businesses: an empirical analysis," "Marco Fanno" Working Papers 0240, Dipartimento di Scienze Economiche "Marco Fanno".
    18. Kaplan, Todd R. & Zamir, Shmuel, 2015. "Advances in Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
    19. Rey, Patrick & Salant, David, 2017. "Allocating essential inputs," TSE Working Papers 17-820, Toulouse School of Economics (TSE), revised Jun 2019.
    20. Sander Onderstal, 2020. "Premium auctions in the field," Review of Economic Design, Springer;Society for Economic Design, vol. 24(1), pages 39-63, June.

    More about this item

    Keywords

    Hybrid auctions; Amsterdam auction; Antwerp auction; perfect Bayesian equilibrium; heuristic strategies;
    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:sek:iacpro:9411761. 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: Klara Cermakova (email available below). General contact details of provider: https://iises.net/ .

    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.