Skip navigation

DSpace

機構典藏 DSpace 系統致力於保存各式數位資料(如:文字、圖片、PDF)並使其易於取用。

點此認識 DSpace
DSpace logo
English
中文
  • 瀏覽論文
    • 校院系所
    • 出版年
    • 作者
    • 標題
    • 關鍵字
    • 指導教授
  • 搜尋 TDR
  • 授權 Q&A
    • 我的頁面
    • 接受 E-mail 通知
    • 編輯個人資料
  1. NTU Theses and Dissertations Repository
  2. 管理學院
  3. 資訊管理學系
請用此 Handle URI 來引用此文件: http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32827
完整後設資料紀錄
DC 欄位值語言
dc.contributor.advisor曹承礎(Seng-Cho Chou)
dc.contributor.authorKai-Fang Liuen
dc.contributor.author劉楷芳zh_TW
dc.date.accessioned2021-06-13T04:16:33Z-
dc.date.available2007-07-31
dc.date.copyright2006-07-31
dc.date.issued2006
dc.date.submitted2006-07-24
dc.identifier.citation[1] A. Andreasen., Attitudes and Customer Behavior: A Decision Model, In L. Preston (ed.), New Research in Marketing. California Institute of Business and Economics Research, University of California, 1965.
[2] Akerlof, G.“The Market for ‘Lemons’: Quality Uncertainty and Market Mechanism, Quarterly Journal of Economics (84:3), pp. 488-500, Aug. 1970.
[3] Alvin E. Roth and Axel Ockenfels, Last-Minute bidding and the Rules for Ending Second-Price Auctions: Evidence from eBay and Amazon Auctions on the Internet, Working Paper, 2002. Available online: http://www.nber.org/papers/w7729.
[4] Alvin E. Roth and Axel Ockenfels, Last-Minute bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from a natural experiment on the internet, American Economic Review, 2000.
[5] Andrew Byde, An Empirical Evidence of Winner’s curse in electronic auctions, Proceeding of the 20th international conference on Information Systems, 1999.
[6] B. Bernheim, Rationalizable Strategic Behavior, Econometrica 52 (1984), pages 1007–1028.
[7] Bansal and R. Garg, Efficiency and Price Discovery in Multi-item Auctions, ACM SIGecom Exchanges, Issue2.1, pp.26-32, 2001.
[8] Beam, C., Segev, A., Automated negotiations: A survey of the state of the art, Wirtschafts- informatik 3/97, pp. 263-267, 1997.
[9] Bichler, An Experimental Analysis of Multi-attribute auctions, Decision Support Systems, Vol. 29, Issue 3, pp. 249-268, Oct 2000.
[10] D. Ferguson, C. Nikolaou, and Y. Yemini, An Economyfor Flow Control in Computer Networks, in Proceedings of the 8th Infocom, IEEE Computer Society Press, Los Alamitos, pages 100–118, 1989.
[11] D. Parkes, Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency, PhD Thesis, Universityof Pennsylvania, 2001.
[12] D. Pearce, Rationalizable Strategic Behavior and the Problem of Perfection, Econometrica 52 (1984), pages 1029–1050.
[13] Dan Ariely, Axel Ockenfels, and Alvin E. Roth, An experimental analysis of ending rules in internet auctions, Forthcoming in Rand Journal of Economics, 2004.
[14] E. Maskin, Nash Equilibrium and Welfare Optimality, Review of Economic Studies 66 (1999), pages 23–38.
[15] F. Nicosia. Consumer Decision Processes: Marketing and Advertising Implications. Prentice Hall, 1966.
[16] H.G. Lee and T.H. Clark, Impact of the Electronic Marketplace on Transaction Cost and Market Structure, International Journal Of Electronic Commerce, Vol. 1 No. 1, Fall 1996, pp. 127-149. http://www.auctioneersfoundation.org/pages/articles_history_auctions.htm
[17] I. Terpsidis, A. Moukas, B. Pergioudakis, G. Doukidis, and P.Maes., The Potential of Electronic Commerce in Re-Engineering Consumer-Retail Relationships through Intelligent Agents, J.-Y. Roger, B. Stanford-Smith, and P.Kidd. (eds.), Advances in Information Technologies: The Business Challenge, IOS Press, 1997.
[18] J. Bettman. An Information Processing Theory to Consumer Choice. Addison-Wessley, 1979.
[19] J. Engel and R. Blackwell. Consumer Behavior, 4th ed. CBS College Publishing, 1982.
[20] J. Feigenbaum, C. Papadimitriou, and S. Shenker, Sharing the Cost of Multicast Transmissions, Journal of Computer and System Sciences 63, pages 21–41, 2001.
[21] J. Howard and J. Sheth. The Theory of Buyer Behavior. John Wiley and Sons, 1969.
[22] J. Smith, Evolution and the Theory of Games, Cambridge University Press, Cambridge, 1982.
[23] J.L.H. Lim, Multi-stage negotiation support: a conceptual framework, Information and Software Technology 41, pp. 249-225, 1999.
[24] Joan Feigenbaum, Scott Shenker, Distributed Algorithmic Mechanism Design: Recent Results and Ruture Directions, Dial-M’02, Atlanta, Georgia, USA, 2002.
[25] Kambil, A., and E. van-Heck, Making Markets, Boston: Harvard Business School, 2002.
[26] Lawrence M. Ausubel, Peter Cramton, and Paul Milgrom, The Clock-Proxy Auction:A Practical Combinatorial Auction Design, Combinatorial Auctions, MIT Press, Chapter 5, 115-138, 2006.
[27] Lin, Raymund J., A Post-auction Negotiation Mechanism for Electronic Marketplace, the Seventeenth International Conference on Software Engineering and Knowledge Engineering, July 14 to 16 2005, Republic of China.
[28] Liu, Kai-fang, Lin, Raymund J. and Seng-Cho T. Chou, En-powering on-line bargainer via Equal-price Bidding Mechanism, Information Management Research and Application Conference, Taipei Taiwan, 16 May, 2006.
[29] Liu, Kai-fang, Raymund J. Lin and Seng-Cho T. Chou, The Design of Equal Price Bidding Mechanism, 2006 Symposium on Application and Development of Management Information System, Taipei Taiwan, 7 June 2006.
[30] Lou Anna K. Simon, President-designate and Provost, Michigan State University Valuing Web Usability & Accessibility: A Colloquium on Standards, Tools, and Testing, May 5, 2003
[31] M. H. Rothkopf, T. J. Teisberg, and E. P. Kahn., Why are Vickrey auctions rare, Journal of Political Economy, 98(1):94--109, 1990.
[32] M. Jackson, A Crash Course in Implementation Theory, Social Choice and Welfare, 18 (2001), pages 655–708.
[33] M. Rothkopf and R. Harstad, Two Model of bid-taker Cheating in Vickrey auctions Journal of Business, Vol. 68, pp.257-267, 1995.
[34] Manoj Kumar, Stuart I. Feldman, Internet Auctions, Proceedings of the 3rd USENIX Workshop on Electronic Commerce Boston, Massachusetts, August 31–September 3, 1998.
[35] Martin J. Osborne and Ariel Rubinstein, A Course in Game Theory, The MIT Press, 1994.
[36] N. Nisan and A. Ronen, Algorithmic mechanism design, Games and Economic Behavior 35 (2001), pages 166–196.
[37] P. Maes., “Agents that Reduce Work and Information Overload.” Communications of the ACM, Vol. 37, No.7, pp. 31-40, 146, ACM Press, July 1994.
[38] P.R. Wurman, M.P. Wellman and W.E. Walsh, A Parameterization of the Auction Design Space, Games and Economic Behavior, (35), 304-338, 2001.
[39] P.R. Wurman, W.E. Walsh, and M.P. Wellman, Flexible Double Auction for Electronic Commerce: Theory and Implementation, Decision Support System, 24, pp.17-27 (1998)
[40] Patrick Bajari and Ali Hortacsu, The Winner’s Curse, Reserve Prices and Endogenous Entry: Empirical Insights From eBay Auctions, Feb. 2002.
[41] R. Gibbens and R. Kelly, Resource Pricing and the Evolution of Congestion Control, Automatica 35, pages 1969–1985, 1999.
[42] R. Guttman, A. Moukas, P. Maes, Agents as mediators in electronic commerce, in: M. Klusch (Ed.), Intelligent Information Agents, Springer, Berlin, 1999 (Chapter 6).
[43] Rasmusen, Eric, Games and Information: An Introduction to Game Theory, 3rd Edition, Cambridge: Blackwell Publisher, 2001.
[44] Robert A. Doyle, CAI-ISA and Steve Baska, History of Auctions, journal of Auctioneer, 2002. Available online:
[45] Shigeo Matsubara, Accelerating Information Revelation in Ascending-Bid Auction – Avoiding Last Minute Bidding, Proceedings of the ACM Conference on Electronic Commerce, 2001.
[46] Turban Efraim, Ephraim Mclean, James c. Wetherbe, Information Technology for Management – Transforming Organizations in the Digital Economy, 4th Edition, Wiley International Edition.
[47] V. Athena, A. Lefteris, and P. Dimitra, Internet Based Auctions: A Survey on Models and Applications, ACM SIG on E-commerce Exchanges, Vol. 2.2, pp. 5-13, June 2001.
[48] W. Vickrey, Counterspeculation, auctions, and competitive sealed tenders, Journal of Finance 16, pages 8–37, 1961.
[49] W. Walsh and M. Wellman, A Market Protocol for Decentralized Task Allocation, in Proceedings of the 3rd International Conference on Multi-Agent Systems, IEEE Computer SocietyPress, Los Alamitos, pages 325–332, 1998.
[50] Winner’s curse, Answers.com Available by http://www.answers.com
[51] Y. Korilis, A. Lazar, and A. Orda, Architecting Non-cooperative Networks, Journal on Selected Areas in Communications 13, pages 1241–1251, 1995.
[52] Y. Shoham and M. Wellman, Economic Principles of Multi-Agent Systems, Artificial Intelligence 94, pages 1–6, 1997.
[53] Yahoo Shopping-Auctions. Available by: http://help.yahoo.com/help/us/auct/abid/abid-03.html
dc.identifier.urihttp://tdr.lib.ntu.edu.tw/jspui/handle/123456789/32827-
dc.description.abstract由於網際網路與電子商務之興起,促進拍賣網站的蓬勃發展,也對於競標價格之決定及撮合買賣方之機制產生革命性的衝擊。拍賣機制不僅可快速、自動化地決定出得標者是誰,近來更被廣泛採用於各大交易系統中。今日於拍賣網站上出售的商品已不具有唯一性,但現存的線上競標機制,如 eBay,仍延用過去英式拍賣之往上加價的特性來競標,其實並不恰當。因此,本研究最主要之貢獻是希望提出一個等價競標機制,除了解決目前存在於線上拍賣網站的弊端,更希望透過等價的概念、透過供給與需求的市場機制,讓買方能充分展現自己所擁有之時間優勢,以較有效率及較低之價格得到此商品。
本研究中,第一部分運用機制設計,提出一個創新的等價線上拍賣機制,探討在等價競標機制下買方之優勢策略為何,並以賽局理論證明此為strategy-proof之完美機制。第二部分系統開發完成具備以軟體代理人出價之等價競標拍賣網站,除了協助使用者在競標時,可節省更多的競價時間外,透過本系統之交易,在研究之第三部分我們期望能更了解此等價機制之經營型態實際運用於電子商務中之可行性,並藉由系統模擬來完成測試與實驗,進而探討透過智慧型代理人,是否能讓買方意識到自己擁有多少議價能力,以及如何擅用自己的時間優勢及對於市場供給和需求量之瞭解,透過此系統中的參數設定與策略選擇,充分展現出自己的議價能力,做出最有利的決策。最後期望買方能以低於市價甚多的價格購買到此商品,創造出一個防止「最後一秒搶標」及「贏者的詛咒」之競標場所。
zh_TW
dc.description.abstractAuctions, which account for an enormous volume of trading/transactions on the Internet, are a fundamental mechanism for automating price negotiations in electronic commerce. The recent growth in Internet auctions has opened a new window on bidding behavior in all kinds of auction mechanisms. Although they are so popular and widely used, there are still some challenges to be considered.
First, commodities in online auctions today are not as unique as those in traditional ones. As we know, the price of commodities is decided by the quantity of supply and demand in whole market. Consequently, it will stay in equilibrium and also each consumer can gain the product with the same price in the market. Since the mechanism of English auction is originally designed for unique-artifact bidding, it does not fit in the current online scenario. The mechanism of Dutch auction, on the other hand, allows bidding at the same price to deal with the trading of quantities of commodities. However, many online auctions are used to sell single unit of non-unique commodities, for which both English and Dutch auctions do not fit.
Second, automations of auctions, like proxy bidding, are not widely used in complicated auctions like Dutch ones. Therefore, the rule of that the earliest successful bids get the goods determines the winning bids; it causes great pressure to human bidders since timely bids are important. On the other hand, most online English auctions leverage proxy bidding to increase automations; however, it suffers the problem of last-minute-bidding if the proxy bidding mechanism is ill designed.
Finally, the problem of winner’s curse exits in online auctions. It is well-known that under information asymmetry, almost common-value auction mechanisms inherently exhibit a serious welfare problem known as the winner’s curse, stating that the winner of the auction always overbids. Although it can be resolved by minimizing bidding increments in English auctions, it is argued here that it can be eliminated completely by the mechanism of equal-price bidding in English auctions.
In short, we study how to design a strategy-proof mechanism for equal-price bidding. It demonstrates three advantages: First, bidders can demonstrate his bargaining power by staying at the same price. Second, proxy bidding is allowed without the problem of last-minute bidding. Third, winner’s curse is avoided since the winning bid needs not to be the highest bid.
en
dc.description.provenanceMade available in DSpace on 2021-06-13T04:16:33Z (GMT). No. of bitstreams: 1
ntu-95-R93725016-1.pdf: 1501370 bytes, checksum: ff576f72e9a418fcc21397ceb6953a9a (MD5)
Previous issue date: 2006
en
dc.description.tableofcontentsChapter 1 Introduction 1
1.1 Background 1
1.2 Motivation 2
1.3 Objective 4
1.4 Organization 5
Chapter 2 Literature Review 7
2.1 Auction Theory 7
2.1.1 Types of Auctions 7
2.1.2 Winner’s Curse 9
2.2 Online Auction 10
2.2.1 Yahoo and eBay 12
2.2.2 Last Minute Bidding 13
2.3 Agents in Electronic Commerce 14
2.3.1 Roles of Agents as Mediators in Electronic Commerce 14
2.3.2 Consumer Buying Behavior Model 15
2.4 Mechanism Design 17
2.4.1 Automated Mechanism Design (AMD) 18
2.4.2 Strategy-proof 18
2.4.3 Discrete Time 20
2.5 Game Theory 21
2.5.1 Elements of a Game 21
2.5.2 Strategy and Equilibrium 23
Chapter 3 EPBM Design 26
3.1 Problem Description 27
The Bidding Problem Scenario 27
3.1.1 27
3.1.2 Assumptions 28
3.2 Mechanism Design 29
3.3 Model Design 31
3.3.1 Proxy Bidding 31
3.3.2 Discrete Time 32
3.3.3 Class and Type 33
3.3.4 Bidding Protocol 35
3.4 EPBM Bidding Process 37
3.4.1 Bidding Rule 37
Chapter 4 Analysis and Proof of EPBM Games 41
4.1 Extensive Game 41
4.2 Definition 43
4.3 Equilibrium 44
4.4 Discussion 47
Chapter 5 System Implementation 51
5.1 EPBM System Flow 51
5.2 Graphical User Interface 53
Chapter 6 Experimental Design and Evaluation 61
6.1 Objective of Experiment 61
6.2 Scenario of Experiment 62
6.3 Simulation Data 63
6.4 Auction Result Analysis 67
6.4.1 Experiment 1: Supply > Demand 67
6.4.2 Experiment 2: Supply = Demand 71
6.4.3 Experiment 3: Supply < Demand 75
6.4.4 Experiment 4: Other Special Cases 79
6.4.5 Implication 81
Chapter 7 Conclusion and Future Work 82
7.1 Conclusion 82
7.2 Managerial Implications 83
7.3 Future Work 90
dc.language.isoen
dc.subject線上拍賣zh_TW
dc.subject機制設計zh_TW
dc.subject賽局理論zh_TW
dc.subject議價能力zh_TW
dc.subject代理人競標zh_TW
dc.subjectOnline auctionen
dc.subjectProxy Biddingen
dc.subjectMechanism designen
dc.subjectBargaining poweren
dc.title以等價競標機制展現競標者之議價能力zh_TW
dc.titleEmpowering Online Bargainer via Equal-price Bidding Mechanismen
dc.typeThesis
dc.date.schoolyear94-2
dc.description.degree碩士
dc.contributor.coadvisor吳玲玲(Ling-Ling Wu)
dc.contributor.oralexamcommittee蔡益坤(Yih-Kuen Tsay),林俊叡(Raymund J. Lin)
dc.subject.keyword代理人競標,線上拍賣,議價能力,賽局理論,機制設計,zh_TW
dc.subject.keywordProxy Bidding,Online auction,Bargaining power,Mechanism design,en
dc.relation.page93
dc.rights.note有償授權
dc.date.accepted2006-07-25
dc.contributor.author-college管理學院zh_TW
dc.contributor.author-dept資訊管理學研究所zh_TW
顯示於系所單位:資訊管理學系

文件中的檔案:
檔案 大小格式 
ntu-95-1.pdf
  未授權公開取用
1.47 MBAdobe PDF
顯示文件簡單紀錄


系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。

社群連結
聯絡資訊
10617臺北市大安區羅斯福路四段1號
No.1 Sec.4, Roosevelt Rd., Taipei, Taiwan, R.O.C. 106
Tel: (02)33662353
Email: ntuetds@ntu.edu.tw
意見箱
相關連結
館藏目錄
國內圖書館整合查詢 MetaCat
臺大學術典藏 NTU Scholars
臺大圖書館數位典藏館
本站聲明
© NTU Library All Rights Reserved