Allocation of advertising space by a web service provider using combinatorial auctions

被引：0
|
作者：
Sandeep Dulluri
N. R. Srinivasa Raghavan
机构：
[1] Indian Institute of Science,Decision Sciences Laboratory, Department of Management Studies
来源：
Sadhana | 2005年 / 30卷
关键词：
Web page service provider (WSP); winner-determination problem (WDP); multi-dimensional knapsack problem (MDKP); combinatorial auction problem (CAP); ant-colony optimization (ACO); online advertisements;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Advertising is a critical process for promoting both products and services in global trade. Internet has emerged as a powerful medium for trade and commerce. Online advertising over the internet has increased more than hundred-fold since 2001. In the present work, we address problems faced by online advertisement service providers. In this paper, we propose a multi-slot and multi-site combinatorial auction for allocating scarce advertisement slots available on multiple sites. We observe that combinatorial auctions serve as effective mechanisms for allocating advertising slots over the internet. We resort to “ant” systems (ant — social insect/intelligent agent) to solve the aboveNP- hard combinatorial optimization problem which involves winner-determination in multi-item and multi-unit combinatorial auctions.
引用
收藏
页码：213 / 230
页数：17
相关论文
共 50 条
  • [41] Development of a Smart Job Allocation Model for a Cloud Service Provider
    Banerjee, Sourav
    Adhikari, Mainak
    Biswas, Utpal
    [J]. 2014 2ND INTERNATIONAL CONFERENCE ON BUSINESS AND INFORMATION MANAGEMENT (ICBIM), 2014,
  • [42] Using mobile web services in electronic auctions
    Puustjarvi, Juha
    [J]. Proceedings of the IASTED International Conference on Advances in Computer Science and Technology, 2006, : 1 - 6
  • [43] Semantic web service selection based on service provider's business offerings
    D'Mello, Demian Antony
    Ananthanarayana, V.S.
    [J]. International Journal of Simulation: Systems, Science and Technology, 2009, 10 (02): : 25 - 37
  • [44] Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules
    Petrakis, Ioannis
    Ziegler, Georg
    Bichler, Martin
    [J]. INFORMATION SYSTEMS RESEARCH, 2013, 24 (03) : 768 - 786
  • [45] An Analysis of Allocation Stability on Approximation-Based Pricing for Multi-unit Combinatorial Auctions
    Fukuta, Naoki
    [J]. RECENT ADVANCES AND FUTURE PROSPECTS IN KNOWLEDGE, INFORMATION AND CREATIVITY SUPPORT SYSTEMS, 2018, 685 : 256 - 269
  • [46] A location-allocation problem for a web services provider in a competitive market
    Aboolian, Robert
    Sun, Yi
    Koehler, Gary J.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 194 (01) : 64 - 77
  • [47] D-Peptide Builder: A Web Service to Enumerate, Analyze, and Visualize the Chemical Space of Combinatorial Peptide Libraries
    Diaz-Eufracio, Barbara I.
    Palomino-Hernandez, Oscar
    Arredondo-Sanchez, Aaron
    Medina-Franco, Jose L.
    [J]. MOLECULAR INFORMATICS, 2020, 39 (11)
  • [48] NSPF: Designing a notification service provider framework for web services
    Kalali, B
    Alencar, P
    Cowan, D
    [J]. WEB, WEB-SERVICES, AND DATABASE SYSTEMS, 2003, 2593 : 73 - 90
  • [49] Web Service Provider Selection under QoS and Security Constraints
    Zhou, Li
    Sun, Yuqing
    [J]. JCPC: 2009 JOINT CONFERENCE ON PERVASIVE COMPUTING, 2009, : 273 - 278
  • [50] Negotiation Between Requester and Provider Based on Pragmatics Web Service
    Zhai Sheping
    Li Zengzhi
    Wei Juanli
    [J]. 2009 WRI INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND MOBILE COMPUTING: CMC 2009, VOL 3, 2009, : 583 - +
12345