Skip to main content

The Urinal Problem

  • Conference paper
Fun with Algorithms (FUN 2010)

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

Included in the following conference series:

Abstract

A man walks into a men’s room and observes n empty urinals. Which urinal should he pick so as to maximize his chances of maintaining privacy, i.e., minimize the chance that someone will occupy a urinal beside him? In this paper, we attempt to answer this question under a variety of models for standard men’s room behavior. Our results suggest that for the most part one should probably choose the urinal furthest from the door (with some interesting exceptions). We also suggest a number of variations on the problem that lead to many open problems.

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 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. American Restroom Association, Public Restroom Design Issues, http://www.americanrestroom.org/design/index.htm

  2. Decker, D.: A Woman’s Guide on How to Pee Standing Up, http://web.archive.org/web/20031202020806/http://www.restrooms.org/standing.html

  3. Flajolet, P.: A Seating Arrangement Problem, http://algo.inria.fr/libraries/autocomb/fatmen-html/fatmen1.html

  4. Freedman, D., Shepp, L.: An Unfriendly Seating Arrangement Problem. SIAM Review 4, 150 (1962)

    Article  Google Scholar 

  5. Friedman, H.D., Rothman, D.: Solution to An Unfriendly Seating Arrangement Problem. SIAM Review 6, 180–182 (1964)

    Article  Google Scholar 

  6. Georgiou, K., Kranakis, E., Krizanc, D.: Random Maximal Independent Sets and the Unfriendly Theater Arrangement Problem. Discrete Mathematics 309, 5120–5129 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hoffman, L.: Computers and Privacy: A Survey. Computing Surveys 1, 85–103 (1969)

    Article  Google Scholar 

  8. International Code Council, International Plumbing Code (2009)

    Google Scholar 

  9. Keane, M., Kranakis, E., Krizanc, D., Narayanan, L.: Routing on Delay Tolerant Sensor Networks. In: Algosensors 2009, pp. 155–166 (2009)

    Google Scholar 

  10. Kleinrock, L.: Queueing Systems, Volume 1: Theory. Wiley, Hoboken (1975)

    Google Scholar 

  11. Knuth, D.: The Toilet Paper Problem. American Math. Monthly 91, 365–370 (1984)

    Article  MathSciNet  Google Scholar 

  12. MacKenzie, J.K.: Sequential Filling of a Line by Intervals Placed at Random and Its Application to Linear Absorption. Journal of Chemical Physics 37, 723–728 (1962)

    Article  Google Scholar 

  13. Paola, C.: A Survey of Obnoxious Facility Location Problems. TR-99-11, University of Pisa, Dept. of Informatics (1999)

    Google Scholar 

  14. Ross, S.M.: Stochastic Processes, 2nd edn. John Wiley & Sons, Inc., Chichester (1996)

    MATH  Google Scholar 

  15. Soifer, S.: The Evolution of the Bathroom and the Implications for Paruresis, http://paruresis.org/evolution.pdf

  16. Vogt, R., Nascimento, M.A., Harns, J.: On the Tradeoff between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks. In: AdHoc Now 2009, pp. 241–254 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kranakis, E., Krizanc, D. (2010). The Urinal Problem. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13122-6_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13121-9

  • Online ISBN: 978-3-642-13122-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics