English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51946/87076 (60%)
Visitors : 8498350      Online Users : 330
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/75975


    Title: Design of a combinational auction mechanism for television advertising market in Taiwan
    Authors: Cheng, Chi-Bin;Wu, Hung-Chung;Chan, C. C. Henry
    Contributors: 淡江大學資訊管理學系
    Keywords: Advertising markets;Auction mechanisms;Combinatorial auction;Computational experiment;Exposure problem;Integer programming problems;Supply and demand;Television commercials;Time slots;TV channels;TV commercial;TV stations;Economics;Integer programming;Marketing;Television;Television broadcasting;Television stations;Commerce
    Date: 2012-10
    Issue Date: 2013-08-08 14:50:50 (UTC+8)
    Publisher: Faisalabad: Medwell Journals
    Abstract: The lack of a transparent mechanism makes the television advertising market in Taiwan extremely volatile to supply and demand changes. To resolve the problem, this study suggests a transparent and fair auction mechanism for the TV advertising market. A characteristic of television commercials is that there exists a synergy between time slots of commercials, i.e., it is more effective for advertisers to acquire some time slots together than just to obtain one of them. A combinatorial auction mechanism is proposed, which enables the advertisers to bid for a set of time slots simultaneously, thus avoiding the problem of losing any item in the bidder desired bundle. This study models the TV commercial combinatorial auction as an integer programming problem. One-month time slots of a TV channel in Taiwan are used in a computational experiment. The problem is solved by LINGO 12.0 and the resulting solutions provide a satisfactory allocation of time slots and maximize revenue for the TV station.
    Relation: Research Journal of Applied Sciences, Engineering and Technology 4(20), pp.4105-4111
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback