Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fun with Algorithms

FUN 2014: Fun with Algorithms pp 183–193Cite as

Competitive Analysis of the Windfall Game

  • Conference paper

  • 1387 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8496))

Abstract

We study the classical computer game ”Super Mario Power Coins” as an online maximization problem with look-ahead. We show nearly matching lower and upper bounds for deterministic online algorithms.

RF acknowledges support by the National Natural Science Foundation of China (No. 60973026), the Shanghai Leading Academic Discipline Project (project number B114), the Shanghai Committee of Science and Technology of China (09DZ2272800), the Robert Bosch Foundation (Science Bridge China 32.5.8003.0040.0), and the Research Council (TRC) of the Sultanate of Oman.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Borodin, A., Linial, N., Saks, M.E.: An optimal online algorithm for metrical task systems. Journal of the ACM 39(4), 745–763 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Jayram, T.S., Kimbrel, T., Krauthgamer, R., Schieber, B., Sviridenko, M.: Online server allocation in a server farm via benefit task systems. In: Proceedings of the 33rd ACM Symposium on the Theory of Computation (STOC 2001), pp. 540–549 (2001)

    Google Scholar 

  3. Manasse, M.S., McGeoch, L.A., Sleator, D.D.: Competitive algorithms for server problems. Journal of Algorithms 11(2), 208–230 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Super Mario Power Coins (2010), http://www.onlinegames.net/games/961/super-mario-power-coins.html

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, IIPL, Fudan University, Shanghai, China

    Rudolf Fleischer

  2. CS Department, GUtech, Muscat, Oman

    Rudolf Fleischer

  3. PICB, Shanghai, China

    Tao Zhang

Authors
  1. Rudolf Fleischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Matematica e Informatica, Città Universitaria, Università degli Studi di Catania, Viale A. Doria, 6, 95125, Catania, Italy

    Alfredo Ferro

  2. Dipartimento di Informatica, Università di Pisa, Largo B. Pontecorvo 3, 56127, Pisa, Italy

    Fabrizio Luccio

  3. Institute of Theoretical Computer Science, ETH Zürich, Universitätsstrasse 6, 8092, Zürich, Switzerland

    Peter Widmayer

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Fleischer, R., Zhang, T. (2014). Competitive Analysis of the Windfall Game. In: Ferro, A., Luccio, F., Widmayer, P. (eds) Fun with Algorithms. FUN 2014. Lecture Notes in Computer Science, vol 8496. Springer, Cham. https://doi.org/10.1007/978-3-319-07890-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07890-8_16

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07889-2

  • Online ISBN: 978-3-319-07890-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation