Skip to main content
SpringerLink
Log in

The Multi-interval Ulam-Rényi Game

  • Conference paper
Fun with Algorithms (FUN 2012)

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

Included in the following conference series:

Abstract

We try to help Paul and Pinocchio to deserve their trip to Venice where they are planning to continue a 50-year long competition in the 20 question game with lies.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlswede, R., Cicalese, F., Deppe, C., Vaccaro, U.: Two Batch Search with Lie Cost. IEEE Transaction on Information Theory 55(4), 1433–1439 (2009)

    Article  MathSciNet  Google Scholar 

  2. Aslam, J., Dhagat, A.: Searching in the presence of linearly bounded errors. In: Proc. of 23rd STOC, pp. 486–493 (1991)

    Google Scholar 

  3. Berlekamp, E.R.: Block coding for the binary symmetric channel with noiseless, delayless feedback. In: Mann, H.B. (ed.) Error-Correcting Codes, pp. 61–68. Wiley, New York (1968)

    Google Scholar 

  4. Cicalese, F., Mundici, D.: Perfect 2-fault tolerant search with minimum adaptiveness. Advances in Applied Mathemathics 25, 65–101 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cicalese, F., Mundici, D., Vaccaro, U.: Rota-Metropolis cubic logic and Ulam-Rényi games. In: Crapo, H., Senato, D. (eds.) Algebraic Combinatorics and Computer Science—A Tribute to Giancarlo Rota, pp. 197–244. Springer Italia (2001)

    Google Scholar 

  6. Cicalese, F., Mundici, D., Vaccaro, U.: Least Adaptive Optimal Search with Unreliable Tests. Theoretical Computer Science 270(1-2), 877–893 (2001)

    Article  MathSciNet  Google Scholar 

  7. Cicalese, F., Deppe, C.: Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 527–536. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Cicalese, F., Gargano, L., Vaccaro, U.: On searching strategies, parallel questions, and delayed answers. Discrete Applied Mathematics 144, 247–262 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cicalese, F., Mundici, D.: Recent Developments of Feedback Coding and Its Relations with Many-Valued Logic. In: van Benthem, J., et al. (eds.) Proof, Computation and Agency, vol. 352(3), pp. 115–131. Springer–Verlag Synthese Library (2011)

    Google Scholar 

  10. Deppe, C.: Coding with feedback and searching with lies. In: Entropy, Search, Complexity. Bolyai Society Mathematical Studies, vol. 16, pp. 27–70 (2007)

    Google Scholar 

  11. Dhagat, A., G’acs, P., Winkler, P.: On Playing “Twenty Questions” with a liar. In: Proc. of 3rd SODA, pp. 16–22 (1992)

    Google Scholar 

  12. Mundici, D., Trombetta, A.: Optimal comparison strategies in Ulam’s searching game with two errors. Theoretical Computer Science 182, 217–232 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  13. Pedrotti, A.: Playing by searching: two strategies against a linearly bounded liar. Theoretical Computer Science 282, 285–302 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pelc, A.: Searching games with errors—Fifty years of coping with liars. Theoretical Computer Science 270(1-2), 71–109 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pelc, A.: Coding with bounded error fraction. Ars. Combinat. 24, 17–22 (1987)

    MathSciNet  MATH  Google Scholar 

  16. Rényi, A.: On a problem of information theory. MTA Mat. Kut. Int. Kozl. 6B, 505–516 (1961)

    Google Scholar 

  17. Rivest, R.L., Meyer, A.R., Kleitman, D.J., Winklmann, K., Spencer, J.: Coping with errors in binary search procedures. JCSS 20, 396–404 (1980)

    MATH  Google Scholar 

  18. Sereno, M.: Binary search with errors and variable cost queries. Information Processing Letters 68(5), 261–270 (1998)

    Article  MathSciNet  Google Scholar 

  19. Spencer, J., Winkler, P.: Three thresholds for a liar. Combinatorics, Probability and Computing 1, 81–93 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  20. Spencer, J.: Guess a number with Lying. Math. Magazine 57, 105–108 (1984)

    Article  MATH  Google Scholar 

  21. Spencer, J.: Ulam’s searching game with a fixed number of lies. Theoretical Computer Science 95, 307–321 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  22. Ulam, S.M.: Adventures of a Mathematician. Scribner’s, New York (1976)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Salerno, Italy

    Ferdinando Cicalese

Authors
  1. Ferdinando Cicalese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Carleton University, 1125 Col. By Dr., K1S 5B6, Ottawa, ON, Canada

    Evangelos Kranakis

  2. Department of Mathematics and Computer Science, Wesleyan University, 06459, Middleton, CT, USA

    Danny Krizanc

  3. Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari, Via Torino 155, 30172, Mestre (Ve), Italy

    Flaminia Luccio

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicalese, F. (2012). The Multi-interval Ulam-Rényi Game. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30347-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30346-3

  • Online ISBN: 978-3-642-30347-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation