CALL FOR PAPERS AND PARTICIPATION
WORKSHOP ON SPONSORED SEARCH AUCTIONS
http://www.acm.org/sigs/sigecom/ec05/workshops.shtml
JUNE 5, 2005
VANCOUVER, BC, CANADA
IN CONJUNCTION WITH THE ACM CONFERENCE ON ELECTRONIC COMMERCE (EC'05)
http://www.acm.org/sigs/sigecom/ec05/
The First Workshop on Sponsored Search Auctions will be held in
conjunction with the ACM Conference on Electronic Commerce (EC'05) in
Vancouver, BC, Canada on June 5, 2005. The focus of the workshop is
on mechanisms and behaviors in sponsored search. The main objective
is to bring together researchers from academia and industry interested
in sponsored search from theoretical, empirical, and experimental
perspectives. The workshop will include presentations on accepted
research contributions, panel discussions, and open discussions.
SPONSORED SEARCH
Sponsored search -- where advertisers pay to appear alongside web
search results -- is a four billion dollar industry, roughly doubling
each year for past three years. Sponsored search is also a perfect
example of the convergence of technology and commerce. Advertising
space is allocated using dynamic auctions. For example, advertisers
like HP and Circuit City compete for the right to appear among the
sponsored results when users search for "digital cameras" on a web
search engine. Meanwhile, simultaneous auctions are running for
"plasma tv", "investment advice", etc. In practice, hundreds of
thousands of advertisers compete for positions alongside several
million search phrases. Generally advertisers can change their bids at
any time, and a new auction clears every time a user enters a search
query. In this way, advertisers can adapt to changing environments,
for example boosting their bids for "Harry Potter" around the release
date of the latest book. Advertisers typically only pay when their ad
is clicked on, a payment structure without analogy in the offline
world.
A formal understanding of mechanisms and behaviors in sponsored search
is somewhat lacking: researchers are just beginning to analyze the
industry empirically, investigate the setting in the laboratory, and
posit theoretical characterizations. Many routes are possible for
optimizing and improving sponsored search from the various (competing)
perspectives of search engines, advertisers, users, search engine
marketers, and placement brokers.
WORKSHOP TOPICS AND CONTRIBUTIONS
We solicit contributions of two types: (1) research contributions, and
(2) "statements of interest." Research contributions should report
new (unpublished) research results or ongoing research. The
workshop's proceedings can be considered non-archival, meaning
contributors are free to publish their results later in archival
journals or conferences. Topics of the workshop include but are not
limited to:
* Mechanism design
* Ranking mechanisms: By bid, by revenue, others
* Game-theoretic analysis of mechanisms, behaviors, and dynamics
* Matching algorithms: exact and inexact match
* Term clustering
* Equilibrium characterizations
* Simulations
* Laboratory experiments
* Empirical characterizations
* Advertiser signalling, collusion
* Pay for conversion, conversion tracking
* Portfolio optimization
* Search engine marketing, optimization (SEMs, SEOs)
* Local (geographic) search
* Contextual advertising (e.g., Google AdSense)
* User satisfaction/defection
* Affiliate model
* Incentive analysis
* Fraud detection and prevention
* Price time series analysis
* Personalization/targeting
* Multiattribute auctions
SUBMISSION INSTRUCTIONS
Research contributions can be up to eight pages long, in double-column
EC proceedings format. Statements of interest are short descriptions
of why the contributor would like to attend the workshop, the
contributor's background and credentials in sponsored search, and what
the contributor hopes to learn or accomplish at the workshop.
Statements of interest should be no more than one or two pages
long. Panel discussion proposals are also welcome. Submissions should
be emailed to pennockd [EMAIL PROTECTED] yahoo-inc.com and Kursad.Asdemir
[EMAIL PROTECTED] alberta.ca no later than April 22 2005.
IMPORTANT DATES
April 22 2005 Submissions Due
May 2 2005 Notification of Accepted Participants
June 5 2005 Workshop Date
PROGRAM COMMITTEE
Kursad Asdemir, University of Alberta
Hemant K. Bharghava, University of California Davis
Jane Feng, University of Florida
Gary W. Flake, Yahoo! Research Labs
David M. Pennock, Yahoo! Research Labs
FURTHER INFORMATION
David Pennock, pennockd [EMAIL PROTECTED] yahoo-inc.com, +1-626-229-8813
or
Kursad Asdemir, Kursad.Asdemir [EMAIL PROTECTED] alberta.ca, +1-780-429-1341
_______________________________________________
uai mailing list
uai@ENGR.ORST.EDU
https://secure.engr.oregonstate.edu/mailman/listinfo/uai
