Skip to main content

A Winner Determination Method on GlobalAd Service: Model and Formulation

  • Chapter
Software and Network Engineering

Part of the book series: Studies in Computational Intelligence ((SCI,volume 413))

  • 717 Accesses

Abstract

The Global Ad is a system to be used when users apply to publish their advertisement on newspapers. The advertisement is registered and uploaded on database that can be viewed by advertising agency. In actual use by multiple users, the system needs to allocate advertising spaces on the newspaper and to calculate the cost to publish the advertisements. Also, the system need to solve a problem like a packing problem with publishing costs/bid value. To solve the problems, in this paper, we propose a winner determination method using 2-dimensional knapsack problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.yahoo.com

  2. http://www.google.com

  3. http://www.adstuff.com/

  4. http://www.releasemyad.com/

  5. Krishna, V.: Auction Theory. Academic Press (2002)

    Google Scholar 

  6. Edelman, B., Ostrovsky, M., Schwarz, M.: Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords. American Economic Review 9(1), 242–259 (2007)

    Article  Google Scholar 

  7. http://www-01.ibm.com/software/integration/optimization/cplex-optimizer

  8. http://www.gurobi.com/

  9. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall (1993)

    Google Scholar 

  10. Korte, B.H., Vygen, J.: Combinatorial optimization: theory and algorithms. Springer (2004)

    Google Scholar 

  11. Korf, R.E.: Optimal Rectangle Packing: New Results. In: Proceeding of the 14th International Conference on Automated Planning & Scheduling, pp. 142–149 (2004)

    Google Scholar 

  12. Backer, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packing in two dimensions. SIAM Journal on Computing 9, 846–855 (1980)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satoshi Takahashi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Takahashi, S., Hashiura, Y., Lee, R.Y., Matsuo, T. (2012). A Winner Determination Method on GlobalAd Service: Model and Formulation. In: Lee, R. (eds) Software and Network Engineering. Studies in Computational Intelligence, vol 413. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28670-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28670-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28669-8

  • Online ISBN: 978-3-642-28670-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics