Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/25456
Title: Search-Based Advertising Auctions with Choice-Based Budget Constraint
Authors: Choi, TM 
Li, X 
Ma, C
Keywords: Generalized second-price (GSP) mechanism
Online auction
Search-based advertising (SA)
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on systems, man, and cybernetics. Systems, 2015, v. 45, no. 8, p. 1178-1186 How to cite?
Journal: IEEE transactions on systems, man, and cybernetics. Systems 
Abstract: In this paper, we model and formulate the search-based advertising auction problem with multiple slots, choice behaviors of advertisers, and the popular generalized second-price mechanism. A Lagrangian-based method is then proposed for tackling this problem. We present an extension to the subgradient algorithm based on Lagrangian relaxation coupled with the column generation method in order to improve the dual multipliers and accelerate its convergence. Simulation results show that the proposed algorithm is efficient and it shows significant improvement compared to the greedy algorithm.
URI: http://hdl.handle.net/10397/25456
ISSN: 2168-2216
EISSN: 2168-2232
DOI: 10.1109/TSMC.2015.2394501
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Aug 13, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Aug 14, 2017

Page view(s)

39
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.