Dynamic resource allocation for OFDMA femtocell networks: a game-theoretic approach
Author
Abstract
Suggested Citation
DOI: 10.1007/s11235-018-0420-x
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ausubel Lawrence M & Milgrom Paul R, 2002.
"Ascending Auctions with Package Bidding,"
The B.E. Journal of Theoretical Economics, De Gruyter, vol. 1(1), pages 1-44, August.
- Lawrence M. Ausubel & Paul Milgrom, 2002. "Ascending Auctions with Package Bidding," Working Papers 02004, Stanford University, Department of Economics.
- Robert Day & Paul Milgrom, 2008. "Core-selecting package auctions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 393-407, March.
- Peter Cramton & Yoav Shoham & Richard Steinberg (ed.), 2006. "Combinatorial Auctions," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262033429, December.
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.- 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.
- Shirata, Yasuhiro, 2017.
"First price package auction with many traders,"
Journal of Mathematical Economics, Elsevier, vol. 69(C), pages 71-83.
- Shirata, Yasuhiro, 2013. "First Price Package Auction with Many Traders," ビジネス創造センターディスカッション・ペーパー (Discussion papers of the Center for Business Creation) 10252/5134, Otaru University of Commerce.
- Vohra, Rakesh V., 2015. "Combinatorial Auctions," Handbook of Game Theory with Economic Applications,, Elsevier.
- Marina Núñez & Francisco Robles, 2023. "Overbidding and underbidding in package allocation problems," UB School of Economics Working Papers 2023/440, University of Barcelona School of Economics.
- Thomas Kittsteiner & Marion Ott & Richard Steinberg, 2022.
"Competing Combinatorial Auctions,"
Information Systems Research, INFORMS, vol. 33(4), pages 1130-1137, December.
- Kittsteiner, Thomas & Ott, Marion & Steinberg, Richard, 2021. "Competing Combinatorial Auctions," EconStor Open Access Articles and Book Chapters, ZBW - Leibniz Information Centre for Economics, issue Ahead of .
- Kittsteiner, Thomas & Ott, Marion & Steinberg, Richard, 2017. "Competing Combinatorial Auctions," EconStor Preprints 171995, ZBW - Leibniz Information Centre for Economics.
- Michael O. Ball & Alexander S. Estes & Mark Hansen & Yulin Liu, 2020. "Quantity-Contingent Auctions and Allocation of Airport Slots," Transportation Science, INFORMS, vol. 54(4), pages 858-881, July.
- 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.
- Scott Kominers & Alexander Teytelboym & Vincent Crawford, 2017. "An Invitation to Market Design," Working Papers 2017-069, Human Capital and Economic Opportunity Working Group.
- 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.
- Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009.
"Winning Play in Spectrum Auctions,"
NBER Working Papers
14765, National Bureau of Economic Research, Inc.
- Jeremy Bulow & Jonathan Levin & Paul Milgrom, 2009. "Winning Play in Spectrum Auctions," Discussion Papers 08-023, Stanford Institute for Economic Policy Research.
- Lamprirni Zarpala & Dimitris Voliotis, 2022. "A core-selecting auction for portfolio's packages," Papers 2206.11516, arXiv.org, revised Feb 2024.
- 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.
- Lamy, Laurent, 2012.
"On minimal ascending auctions with payment discounts,"
Games and Economic Behavior, Elsevier, vol. 75(2), pages 990-999.
- Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," PSE-Ecole d'économie de Paris (Postprint) halshs-00754581, HAL.
- Laurent Lamy, 2012. "On minimal ascending auctions with payment discounts," Post-Print halshs-00754581, HAL.
- 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.
- Talman, A.J.J. & Yang, Z.F., 2011. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Paper 2011-096, Tilburg University, Center for Economic Research.
- Talman, A.J.J. & Yang, Z.F., 2011. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Other publications TiSEM 49292c72-515d-42f4-a0d4-c, Tilburg University, School of Economics and Management.
- Dolf Talman & Zaifu Yang, 2013. "An Efficient Multi-Item Dynamic Auction with Budget Constrained Bidders," Discussion Papers 13/31, Department of Economics, University of York.
- Robert W. Day & Peter Cramton, 2012.
"Quadratic Core-Selecting Payment Rules for Combinatorial Auctions,"
Operations Research, INFORMS, vol. 60(3), pages 588-603, June.
- Robert Day & Peter Cramton, 2008. "Quadratic Core-Selecting Payment Rules for Combinatorial Auctions," Papers of Peter Cramton 08qcspr, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
- Laurent Lamy, 2010.
"Core-selecting package auctions: a comment on revenue-monotonicity,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 503-510, July.
- Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," PSE-Ecole d'économie de Paris (Postprint) halshs-00754436, HAL.
- Laurent Lamy, 2010. "Core-selecting package auctions: a comment on revenue-monotonicity," Post-Print halshs-00754436, HAL.
- Lawrence M. Ausubel & Peter Cramton, 2012. "Activity Rules for the Combinatorial Clock Auction," Papers of Peter Cramton 11acar, University of Maryland, Department of Economics - Peter Cramton, revised 2012.
- Aytek Erdil & Paul Klemperer, 2010.
"A New Payment Rule for Core-Selecting Package Auctions,"
Journal of the European Economic Association, MIT Press, vol. 8(2-3), pages 537-547, 04-05.
- Aytek Erdil & Paul Klemperer, 2009. "A New Payment Rule for Core-Selecting Package Auctions," Economics Papers 2009-W11, Economics Group, Nuffield College, University of Oxford.
- Klemperer, Paul & Erdil, Aytek, 2009. "A New Payment Rule for Core-Selecting Package Auctions," CEPR Discussion Papers 7487, C.E.P.R. Discussion Papers.
- 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.
- Mochon, A. & Saez, Y. & Gomez-Barroso, J.L. & Isasi, P., 2012. "Exploring pricing rules in combinatorial sealed-bid auctions," Journal of Economic Behavior & Organization, Elsevier, vol. 82(2), pages 462-478.
- Paul Milgrom, 2009.
"Assignment Messages and Exchanges,"
American Economic Journal: Microeconomics, American Economic Association, vol. 1(2), pages 95-113, August.
- Paul Milgrom, 2008. "Assignment Messages and Exchanges," Discussion Papers 08-014, Stanford Institute for Economic Policy Research.
- 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.
More about this item
Keywords
Resource allocation; VCG auction; Game theory; Quality of service; Q-learning algorithm; Femtocell networks;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:telsys:v:69:y:2018:i:1:d:10.1007_s11235-018-0420-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.