IDEAS home Printed from https://ideas.repec.org/f/pba1181.html
   My authors  Follow this author

Oleg Baranov

Personal Details

First Name:Oleg
Middle Name:
Last Name:Baranov
Suffix:
RePEc Short-ID:pba1181
http://obaranov.com
(303) 492-7869

Affiliation

Department of Economics
University of Colorado

Boulder, Colorado (United States)
https://www.colorado.edu/economics/
RePEc:edi:decolus (more details at EDIRC)

Research output

as
Jump to: Articles

Articles

  1. Lawrence M. Ausubel & Oleg Baranov, 2020. "Core-selecting auctions with incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 251-273, March.
  2. Lawrence M. Ausubel & Oleg Baranov, 2020. "Revealed Preference And Activity Rules In Dynamic Auctions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(2), pages 471-502, May.
  3. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
  4. Lawrence M. Ausubel & Oleg Baranov, 2017. "A Practical Guide to the Combinatorial Clock Auction," Economic Journal, Royal Economic Society, vol. 127(605), pages 334-350, October.
  5. Oleg Baranov & Christina Aperjis & Lawrence M. Ausubel & Thayer Morrill, 2017. "Efficient Procurement Auctions with Increasing Returns," American Economic Journal: Microeconomics, American Economic Association, vol. 9(3), pages 1-27, August.
  6. Lawrence M. Ausubel & Oleg V. Baranov, 2014. "Market Design and the Evolution of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 104(5), pages 446-451, May.

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Articles

  1. Lawrence M. Ausubel & Oleg Baranov, 2020. "Core-selecting auctions with incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 251-273, March.

    Cited by:

    1. Alexander Teytelboym, 2019. "Natural capital market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 35(1), pages 138-161.
    2. , K. & ,, 2016. "On the impossibility of core-selecting auctions," Theoretical Economics, Econometric Society, vol. 11(1), January.
    3. Mikhail Safronov, 2016. "A Coasian Approach to Efficient Mechanism Design," Cambridge Working Papers in Economics 1619, Faculty of Economics, University of Cambridge.
    4. Maarten Janssen & Bernhard Kasberger, 2016. "On the Clock of the Combinatorial Clock Auction," Vienna Economics Papers vie1607, University of Vienna, Department of Economics.
    5. Ryuji Sano, 2015. "Improving Efficiency Using Reserve Prices: An Equilibrium Analysis of Core-Selecting Auctions," KIER Working Papers 926, Kyoto University, Institute of Economic Research.
    6. Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
    7. Bichler, Martin & Kohring, Nils & Oberlechner, Matthias & Pieroth, Fabian R., 2023. "Learning equilibrium in bilateral bargaining games," European Journal of Operational Research, Elsevier, vol. 311(2), pages 660-678.
    8. Ott, Marion & Beck, Marissa, 2013. "Incentives for Overbidding in Minimum-Revenue Core-Selecting Auctions," VfS Annual Conference 2013 (Duesseldorf): Competition Policy and Regulation in a Global Economic Order 79946, Verein für Socialpolitik / German Economic Association.
    9. Daniel Marszalec, 2016. "Auctions For Complements –An Experimental Analysis," CIRJE F-Series CIRJE-F-1018, CIRJE, Faculty of Economics, University of Tokyo.
    10. Peter Cramton, 2013. "Spectrum Auction Design," Review of Industrial Organization, Springer;The Industrial Organization Society, vol. 42(2), pages 161-190, March.
    11. Jonathan Levin & Andrzej Skrzypacz, 2014. "Are Dynamic Vickrey Auctions Practical?: Properties of the Combinatorial Clock Auction," NBER Working Papers 20487, National Bureau of Economic Research, Inc.
    12. Bichler, Martin & Paulsen, Per, 2018. "A principal-agent model of bidding firms in multi-unit auctions," Games and Economic Behavior, Elsevier, vol. 111(C), pages 20-40.
    13. Jeong, Seungwon (Eugene) & Lee, Joosung, 2024. "The groupwise-pivotal referral auction: Core-selecting referral strategy-proof mechanism," Games and Economic Behavior, Elsevier, vol. 143(C), pages 191-203.
    14. Ott, Marion, 2019. "Simple Bayesian and Ex-Post Equilibria in Combinatorial Auctions," VfS Annual Conference 2019 (Leipzig): 30 Years after the Fall of the Berlin Wall - Democracy and Market Economy 203616, Verein für Socialpolitik / German Economic Association.
    15. Jonathan Levin & Andrzej Skrzypacz, 2016. "Properties of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 106(9), pages 2528-2551, September.
    16. Marszalec, Daniel, 2018. "Fear not the simplicity - An experimental analysis of auctions for complements," Journal of Economic Behavior & Organization, Elsevier, vol. 152(C), pages 81-97.
    17. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    18. Kittsteiner, Thomas & Ott, Marion & Steinberg, Richard, 2017. "Competing Combinatorial Auctions," EconStor Preprints 171995, ZBW - Leibniz Information Centre for Economics.

  2. Lawrence M. Ausubel & Oleg Baranov, 2020. "Revealed Preference And Activity Rules In Dynamic Auctions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(2), pages 471-502, May.

    Cited by:

    1. 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.
    2. Yan Chen & Peter Cramton & John A. List & Axel Ockenfels, 2021. "Market Design, Human Behavior, and Management," Management Science, INFORMS, vol. 67(9), pages 5317-5348, September.

  3. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.

    Cited by:

    1. Yan, Haomin, 2021. "Position auctions with multi-unit demands," Games and Economic Behavior, Elsevier, vol. 127(C), pages 179-193.

  4. Lawrence M. Ausubel & Oleg Baranov, 2017. "A Practical Guide to the Combinatorial Clock Auction," Economic Journal, Royal Economic Society, vol. 127(605), pages 334-350, October.

    Cited by:

    1. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    2. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
    3. Palacios-Huerta, Ignacio & Parkes, David C. & Steinberg, Richard, 2024. "Combinatorial auctions in practice," LSE Research Online Documents on Economics 124108, London School of Economics and Political Science, LSE Library.
    4. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    5. David R. Munro & Stephen Rassenti, 2011. "Combinatorial Clock Auctions: Price Direction and Performance," Working Papers 11-19, Chapman University, Economic Science Institute.
    6. Benedikt Bünz & Benjamin Lubin & Sven Seuken, 2022. "Designing Core-Selecting Payment Rules: A Computational Search Approach," Information Systems Research, INFORMS, vol. 33(4), pages 1157-1173, December.
    7. Kasberger, Bernhard, 2023. "When can auctions maximize post-auction welfare?," International Journal of Industrial Organization, Elsevier, vol. 89(C).
    8. Ehrhart, Karl-Martin & Ott, Marion & Seifert, Stefan & Wang, Runxi, 2024. "Combinatorial auctions for renewable energy — potentials and challenges," Energy Policy, Elsevier, vol. 186(C).
    9. Beltrán, Fernando & Massaro, Maria, 2018. "Spectrum management for 5G: assignment methods for spectrum sharing," 29th European Regional ITS Conference, Trento 2018 184932, International Telecommunications Society (ITS).
    10. Lawrence M. Ausubel & Oleg Baranov, 2020. "Core-selecting auctions with incomplete information," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 251-273, March.
    11. Ott, Marion, 2019. "Simple Bayesian and Ex-Post Equilibria in Combinatorial Auctions," VfS Annual Conference 2019 (Leipzig): 30 Years after the Fall of the Berlin Wall - Democracy and Market Economy 203616, Verein für Socialpolitik / German Economic Association.
    12. Blumrosen, Liad & Solan, Eilon, 2023. "Selling spectrum in the presence of shared networks: The case of the Israeli 5G auction," Telecommunications Policy, Elsevier, vol. 47(2).
    13. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    14. Kuś, Agnieszka & Massaro, Maria, 2022. "Analysing the C-Band spectrum auctions for 5G in Europe: Achieving efficiency and fair decisions in radio spectrum management," Telecommunications Policy, Elsevier, vol. 46(4).

  5. Oleg Baranov & Christina Aperjis & Lawrence M. Ausubel & Thayer Morrill, 2017. "Efficient Procurement Auctions with Increasing Returns," American Economic Journal: Microeconomics, American Economic Association, vol. 9(3), pages 1-27, August.

    Cited by:

    1. Loertscher, Simon & Marx, Leslie M., 2023. "Asymptotically optimal prior-free asset market mechanisms," Games and Economic Behavior, Elsevier, vol. 137(C), pages 68-90.
    2. Baranov, Oleg, 2018. "An efficient ascending auction for private valuations," Journal of Economic Theory, Elsevier, vol. 177(C), pages 495-517.
    3. Bernhard Kasberger & Alexander Teytelboym, 2022. "The Combinatorial Multi-Round Ascending Auction," Papers 2203.11783, arXiv.org, revised Feb 2024.

  6. Lawrence M. Ausubel & Oleg V. Baranov, 2014. "Market Design and the Evolution of the Combinatorial Clock Auction," American Economic Review, American Economic Association, vol. 104(5), pages 446-451, May.

    Cited by:

    1. Kazumori, Eiichiro & Belch, Yaakov, 2019. "t-Tree: The Tokyo toolbox for large-scale combinatorial auction experiments," Journal of Behavioral and Experimental Finance, Elsevier, vol. 24(C).
    2. Christian Kroemer & Martin Bichler & Andor Goetzendorff, 2016. "(Un)expected Bidder Behavior in Spectrum Auctions: About Inconsistent Bidding and Its Impact on Efficiency in the Combinatorial Clock Auction," Group Decision and Negotiation, Springer, vol. 25(1), pages 31-63, January.
    3. Kominers, Scott Duke & Teytelboym, Alexander & Crawford, Vincent P, 2017. "An invitation to market design," University of California at San Diego, Economics Working Paper Series qt3xp2110t, Department of Economics, UC San Diego.
    4. Bó, Inácio Guerberoff Lanari & Hakimov, Rustamdjan, 2016. "The iterative deferred acceptance mechanism," Discussion Papers, Research Unit: Market Behavior SP II 2016-212, WZB Berlin Social Science Center.
    5. Ryuji Sano, 2015. "Improving Efficiency Using Reserve Prices: An Equilibrium Analysis of Core-Selecting Auctions," KIER Working Papers 926, Kyoto University, Institute of Economic Research.
    6. Mochon, Asuncion & Saez, Yago, 2017. "A review of radio spectrum combinatorial clock auctions," Telecommunications Policy, Elsevier, vol. 41(5), pages 303-324.
    7. Heczko, Alexander & Kittsteiner, Thomas & Ott, Marion, 2018. "The Performance of Core-Selecting Auctions: An Experiment," EconStor Preprints 176842, ZBW - Leibniz Information Centre for Economics.
    8. Lawrence M. Ausubel & Oleg Baranov, 2020. "Revealed Preference And Activity Rules In Dynamic Auctions," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 61(2), pages 471-502, May.
    9. Janssen, Maarten & Karamychev, Vladimir, 2016. "Spiteful bidding and gaming in combinatorial clock auctions," Games and Economic Behavior, Elsevier, vol. 100(C), pages 186-207.
    10. Martin Bichler & Paul Milgrom & Gregor Schwarz, 2023. "Taming the Communication and Computation Complexity of Combinatorial Auctions: The FUEL Bid Language," Management Science, INFORMS, vol. 69(4), pages 2217-2238, April.
    11. Committee, Nobel Prize, 2020. "Improvements to auction theory and inventions of new auction formats," Nobel Prize in Economics documents 2020-2, Nobel Prize Committee.
    12. Blumrosen, Liad & Solan, Eilon, 2023. "Selling spectrum in the presence of shared networks: The case of the Israeli 5G auction," Telecommunications Policy, Elsevier, vol. 47(2).
    13. Ryuji Sano, 2018. "An equilibrium analysis of a core-selecting package auction with reserve prices," Review of Economic Design, Springer;Society for Economic Design, vol. 22(3), pages 101-122, December.
    14. Kittsteiner, Thomas & Ott, Marion & Steinberg, Richard, 2017. "Competing Combinatorial Auctions," EconStor Preprints 171995, ZBW - Leibniz Information Centre for Economics.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Oleg Baranov should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

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