Academic literature on the topic 'Online auctions'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Online auctions.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Online auctions"
Kokila, S., J. AbalinLuther, and T. Marivijayakumar. "Online Auction System." International Journal on Cybernetics & Informatics 10, no. 2 (May 31, 2021): 289–96. http://dx.doi.org/10.5121/ijci.2021.100232.
Full textLi, Xiaohui, and Hongbin Dong. "A Transaction Trade-Off Utility Function Approach for Predicting the End-Price of Online Auctions in IoT." Wireless Communications and Mobile Computing 2021 (February 2, 2021): 1–10. http://dx.doi.org/10.1155/2021/6656421.
Full textLeung, Timothy L. Y., and William J. Knottenbelt. "Consumer-to-Consumer Internet Auction Models." International Journal of Online Marketing 1, no. 3 (July 2011): 17–28. http://dx.doi.org/10.4018/ijom.2011070102.
Full textCypryjański, Jacek, and Aleksandra Grzesiuk. "The Role of Signals in Online Auction Purchase Decisions." Folia Oeconomica Stetinensia 15, no. 1 (June 1, 2015): 53–68. http://dx.doi.org/10.1515/foli-2015-0019.
Full textRathi, Nikhil, Prajwal Ghonmode, Piyush Chikte, Vishal Kalambe, Rushikesh Wanve, and Shailesh Kurzadkar. "Online Auction System." International Journal of Computer Science and Mobile Computing 11, no. 3 (March 30, 2022): 17–22. http://dx.doi.org/10.47760/ijcsmc.2022.v11i03.002.
Full textSalim, Vina Putri, and Bambang Sugeng Ariadi Subagyono. "Keabsahan Lelang Non Eksekusi Sukarela Secara Online Tanpa Pejabat Lelang." Notaire 5, no. 1 (February 24, 2022): 155. http://dx.doi.org/10.20473/ntr.v5i1.33641.
Full textBourron, Christine. "How Has COVID-19 Affected the Public Auction Market?" Arts 10, no. 4 (November 1, 2021): 74. http://dx.doi.org/10.3390/arts10040074.
Full textEmiliani, M. L., and D. J. Stec. "Wood pallet suppliers' reaction to online reverse auctions." Supply Chain Management: An International Journal 10, no. 4 (September 1, 2005): 278–87. http://dx.doi.org/10.1108/13598540510612758.
Full textSaprykina, V. Yu, and V. F. Milvanov. "The auction trade in Russia." Scientific bulletin of the Southern Institute of Management, no. 1 (April 27, 2019): 81–86. http://dx.doi.org/10.31775/2305-3100-2019-1-81-86.
Full textHan, Jidong, Chun Qiu, and Peter Popkowski Leszczyc. "The effects of competitive reserve prices in online auctions." European Journal of Marketing 52, no. 7/8 (July 9, 2018): 1439–56. http://dx.doi.org/10.1108/ejm-10-2017-0684.
Full textDissertations / Theses on the topic "Online auctions"
Beil, Damian. "Two topics in online auctions." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/17578.
Full textIncludes bibliographical references (p. 83-85).
This thesis studies two operations management topics in online auctions, and is divided into two parts. Motivated by the increasing use of ShopBots to scan Internet auctions, the first part of the thesis analytically examines whether or not two competing auctioneers selling the same commodity should share, or pool, some or all of their bidders. Under pooling, the bidding population is represented by three compartments: bidders dedicated to auction 1, bidders dedicated to auction 2, and pooled bidders participating in both auctions simultaneously. Under a bidder strategy shown to induce a Bayesian equilibrium, a closed form expression for the auctioneers' expected revenue under pooling is found, and pooling is recommended where it produces a greater expected revenue than no pooling (i.e., our objective is revenue maximization). Pooling is generally found to be beneficial as long as the two auctions are not too asymmetric and the underlying valuation distribution has certain concavity characteristics. Asymptotic order statistic arguments are used where explicit characterizations are intractable. The second part of the thesis considers a manufacturer who uses a reverse, or procurement, auction to determine which supplier will be awarded a contract. Each bid consists of a price and a set of non-price attributes (e.g., quality, lead time). The manufacturer is assumed to know the suppliers' cost functions (in terms of the non-price attributes). We analyze how the manufacturer chooses a scoring rule (i.e., a function that ranks the bids in terms of the price and non-price attributes) that attempts to maximize his own utility. Under the assumption that suppliers submit their myopic best-response bids (i.e., they choose their minimum-cost bid to achieve any given score), our proposed scoring rule indeed maximizes the manufacturer's utility within the open-ascending format.
(cont.) The analysis reveals connections between the manufacturer's utility maximization problem and various geometric aspects of the manufacturer's utility and the suppliers' cost functions.
by Damian Ronald Beil.
Ph.D.
Gupta, Shobhit. "Buyout prices in online auctions." Thesis, Massachusetts Institute of Technology, 2006. http://hdl.handle.net/1721.1/36223.
Full textIncludes bibliographical references (p. 149-154).
Buyout options allow bidders to instantly purchase at a specified price an item listed for sale through an online auction. A temporary buyout option disappears once a regular bid above the reserve price is made, while a permanent option remains available until it is exercised or the auction ends. Buyout options are widely used in online auctions and have significant economic importance: nearly half of the auctions today are listed with a buyout price and the option is exercised in nearly one fourth of them. We formulate a game-theoretic model featuring time-sensitive bidders with independent private valuations and Poisson arrivals but endogenous bidding times in order to answer the following questions: How should buyout prices be set in order to maximize the seller's discounted revenue? What are the relative benefits of using each type of buyout option? While all existing buyout options we are aware of currently rely on a static buyout price (i.e. with a constant value), what is the potential benefit associated with using instead a dynamic buyout price that varies as the auction progresses?
(cont.) For all buyout option types we exhibit a Nash equilibrium in bidder strategies, argue that this equilibrium constitutes a plausible outcome prediction, and study the problem of maximizing the corresponding seller revenue. In particular, the equilibrium strategy in all cases is such that a bidder exercises the buyout option provided it is still available and his valuation is above a time-dependent threshold. Our numerical experiments suggest that a seller may significantly increase his utility by introducing a buyout option when any of the participants are time-sensitive. Furthermore, while permanent buyout options yield higher predicted revenue than temporary options, they also provide additional incentives for late bidding and may therefore not be always more desirable. The numerical results also imply that the increase in seller's utility (over a fixed buyout price auction) enabled by a dynamic buyout price is small and does not seem to justify the corresponding increase in complexity.
by Shobhit Gupta.
Ph.D.
Peterson, Madeleine. "New Technology, Old Ways? The Gender Price Discount in Online Contemporary Art Auctions." Scholarship @ Claremont, 2019. https://scholarship.claremont.edu/scripps_theses/1265.
Full textParker, Thomas Glenn. "ONLINE-REVERSE-AUCTIONS AND THE BUYER-SUPPLIER RELATIONSHIP: THE EFFECTS OF ONLINE-REVERSE-AUCTION DESIGN ON SUPPLIER COMMITMENT AND SUPPLIER TRUST." OpenSIUC, 2010. https://opensiuc.lib.siu.edu/dissertations/192.
Full textNamazi, Alireza. "Emergent behavior and criticality in online auctions." [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=976716739.
Full textØdegaard, Fredrik. "Analytical and empirical models of online auctions." Thesis, University of British Columbia, 2008. http://hdl.handle.net/2429/1615.
Full textAnthony, Patricia. "Bidding agents for multiple heterogeneous online auctions." Thesis, University of Southampton, 2003. https://eprints.soton.ac.uk/257838/.
Full textRadkevitch, Ulad. "Online reverse auctions for procurement of services /." Rotterdam : Erasmus Research Institute of Management, 2008. http://hdl.handle.net/1765/13497.
Full textVINIJSORN, KRIT. "Art auctions on eBay : An empirical study of bidders’ behavior on eBay." Thesis, Högskolan i Jönköping, Internationella Handelshögskolan, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hj:diva-15890.
Full textRameson, Tyler J. (Tyler James) 1974. "Online auctions in procurement : the cost/goodwill tradeoff." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/9157.
Full textIncludes bibliographical references (leaf 44).
Industry is rapidly adopting online auctions. Many of these auctions are occurring in the procurement of component supplies. While there are tremendous expectations for this technology, there is little data or study looking at the implications of the technology. This thesis aims to provide some insight into this topic. Primarily using data collected in a study of auctions in the procurement of automotive components, this thesis looks at the costs and benefits of using online auctions in procurement. The thesis specifically addresses the cost vs. supplier goodwill tradeoff present in procurement auction. After quantifying these variables and answering associated questions, the thesis provides a framework for evaluating the use of online auctions in industry in general. The thesis concludes with a list of suggested further research into this important subject.
Tyler J. Rameson.
M.Eng.
Books on the topic "Online auctions"
Ockenfels, Axel. Online auctions. Cambridge, Mass: National Bureau of Economic Research, 2006.
Find full textO'Loughlin, Luanne. Online Auctions. New York: McGraw-Hill, 2001.
Find full textJank, Wolfgang, and Galit Shmueli. Modeling Online Auctions. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2010. http://dx.doi.org/10.1002/9780470642603.
Full text1971-, Shmueli Galit, and Wiley online library, eds. Modeling online auctions. Oxford: Wiley-Blackwell, 2010.
Find full textCollector's guide to online auctions. Paducah, Ky: Collector Books, 2000.
Find full textDunckel, Till. Online-Auktionen und Wettbewerbsrecht. Frankfurt am Main: Lang, 2007.
Find full textPrince, Dennis L. Auction this!: Your complete guide to the world of online auctions. Rocklin, Calif: Prima Tech, 1999.
Find full textThe complete idiot's guide to online auctions. Indianapolis, Ind: Que, 1999.
Find full textOnline auctions at eBay 2000: Bid with confidence, sell with success. 2nd ed. Rocklin, CA: Prima Publishing, 1999.
Find full textLeo, Patrick. Selling online: How to start a home-based business selling used books, DVD's and more online. Brea, CA: P & L Publications, 2009.
Find full textBook chapters on the topic "Online auctions"
Mochón, Asunción, and Yago Sáez. "Online Auctions." In Springer Texts in Business and Economics, 121–29. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08813-6_9.
Full textDeng, Yuan, Debmalya Panigrahi, and Hanrui Zhang. "Online Combinatorial Auctions." In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 1131–49. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2021. http://dx.doi.org/10.1137/1.9781611976465.70.
Full textPereira, Adriano, Fernando Mourão, Paulo Góes, and Wagner Meira. "Reactivity in Online Auctions." In Current Trends in Database Technology – EDBT 2006, 909–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11896548_69.
Full textHajiaghayi, Mohammad Taghi, and Vahid Liaghat. "Prophet Inequality and Online Auctions." In Encyclopedia of Algorithms, 1634–36. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_759.
Full textBateni, MohammadHossein. "Secretary Problems and Online Auctions." In Encyclopedia of Algorithms, 1910–13. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_760.
Full textHajiaghayi, Mohammad Taghi, and Vahid Liaghat. "Prophet Inequality and Online Auctions." In Encyclopedia of Algorithms, 1–4. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-642-27848-8_759-1.
Full textBateni, MohammadHossein. "Secretary Problems and Online Auctions." In Encyclopedia of Algorithms, 1–4. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_760-1.
Full textHarada, Shigeaki, Eiji Takimoto, and Akira Maruoka. "Aggregating Strategy for Online Auctions." In Lecture Notes in Computer Science, 33–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11809678_6.
Full textMohapatra, Sanjay. "E-commerce and Online Auctions." In Springer Texts in Business and Economics, 127–54. Boston, MA: Springer US, 2012. http://dx.doi.org/10.1007/978-1-4614-4142-7_6.
Full textBrandes, Philipp, Zengfeng Huang, Hsin-Hao Su, and Roger Wattenhofer. "Clairvoyant Mechanisms for Online Auctions." In Lecture Notes in Computer Science, 3–14. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42634-1_1.
Full textConference papers on the topic "Online auctions"
Hu, Wenyan, and Alvaro Bolivar. "Online auctions efficiency." In Proceeding of the 17th international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1367497.1367621.
Full textBabaioff, Moshe, Liad Blumrosen, and Aaron Roth. "Auctions with online supply." In the 11th ACM conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1807342.1807345.
Full text"SECURE ONLINE ENGLISH AUCTIONS." In International Conference on Security and Cryptography. SciTePress - Science and and Technology Publications, 2006. http://dx.doi.org/10.5220/0002096603870396.
Full textShen, Weiran, Zihe Wang, and Song Zuo. "Ex-post IR Dynamic Auctions with Cost-per-Action Payments." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/70.
Full textBubeck, Sebastien, Nikhil R. Devanur, Zhiyi Huang, and Rad Niazadeh. "Online Auctions and Multi-scale Online Learning." In EC '17: ACM Conference on Economics and Computation. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3033274.3085145.
Full textHajiaghayi, Mohammad Taghi, Robert Kleinberg, and David C. Parkes. "Adaptive limited-supply online auctions." In the 5th ACM conference. New York, New York, USA: ACM Press, 2004. http://dx.doi.org/10.1145/988772.988784.
Full textSheng-li, Chen, Luo Yun-feng, and Dai Bao. "Optimal Design of Online Auctions." In 2007 International Conference on Management Science and Engineering. IEEE, 2007. http://dx.doi.org/10.1109/icmse.2007.4421826.
Full textKuruzovich, Jason. "Online Auctions and Multichannel Retailing." In 2012 45th Hawaii International Conference on System Sciences (HICSS). IEEE, 2012. http://dx.doi.org/10.1109/hicss.2012.457.
Full textGoel, Gagan, Vahab Mirrokni, and Renato Paes Leme. "Clinching Auctions with Online Supply." In Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2013. http://dx.doi.org/10.1137/1.9781611973105.44.
Full textCohen, Ilan Reuven, Alon Eden, Amos Fiat, and Łukasz Jeż. "Pricing Online Decisions: Beyond Auctions." In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2014. http://dx.doi.org/10.1137/1.9781611973730.7.
Full textReports on the topic "Online auctions"
Ockenfels, Axel, David Reiley, and Abdolkarim Sadrieh. Online Auctions. Cambridge, MA: National Bureau of Economic Research, December 2006. http://dx.doi.org/10.3386/w12785.
Full textCoey, Dominic, Bradley Larsen, Kane Sweeney, and Caio Waisman. The Simple Empirics of Optimal Online Auctions. Cambridge, MA: National Bureau of Economic Research, June 2018. http://dx.doi.org/10.3386/w24698.
Full textDecarolis, Francesco, Maris Goldmanis, and Antonio Penta. Marketing Agencies and Collusive Bidding in Online Ad Auctions. Cambridge, MA: National Bureau of Economic Research, October 2017. http://dx.doi.org/10.3386/w23962.
Full textEinav, Liran, Chiara Farronato, Jonathan Levin, and Neel Sundaresan. Sales Mechanisms in Online Markets: What Happened to Internet Auctions? Cambridge, MA: National Bureau of Economic Research, May 2013. http://dx.doi.org/10.3386/w19021.
Full textHendricks, Kenneth, and Alan Sorensen. Dynamics and Efficiency in Decentralized Online Auction Markets. Cambridge, MA: National Bureau of Economic Research, September 2018. http://dx.doi.org/10.3386/w25002.
Full textBackus, Matthew, Tom Blake, Dimitriy Masterov, and Steven Tadelis. Is Sniping A Problem For Online Auction Markets? Cambridge, MA: National Bureau of Economic Research, February 2015. http://dx.doi.org/10.3386/w20942.
Full text