2015-06-27

# Excuse me! or the courteous theatregoers' problem

## Publication

### Publication

*Theoretical Computer Science , Volume 586 p. 95- 110*

Consider a theatre consisting of m rows each containing n seats. Theatregoers enter the theatre along aisles and pick a row which they enter along one of its two entrances so as to occupy a seat. Assume they select their seats uniformly and independently at random among the empty ones. A row of seats is narrow and an occupant who is already occupying a seat is blocking passage to new incoming theatregoers. As a consequence, occupying a specific seat depends on the courtesy of theatregoers and their willingness to get up so as to create free space that will allow passage to others. Thus, courtesy facilitates and may well increase the overall seat occupancy of the theatre. We say a theatregoer is courteous if (s)he will get up to let others pass. Otherwise, the theatregoer is selfish. A set of theatregoers is courteous with probability p (or p-courteous, for short) if each theatregoer in the set is courteous with probability p, randomly and independently. It is assumed that the behaviour of a theatregoer does not change during the occupancy of the row. Thus, p=. 1 represents the case where all theatregoers are courteous and p=. 0 when they are all selfish.In this paper, we are interested in the following question: what is the expected number of occupied seats as a function of the total number of seats in a theatre, n, and the probability that a theatregoer is courteous, p? We study and analyze interesting variants of this problem reflecting behaviour of the theatregoers as entirely selfish, and p-courteous for a row of seats with one or two entrances and as a consequence for a theatre with m rows of seats with multiple aisles. We also consider the case where seats in a row are chosen according to the geometric distribution and the Zipf distribution (as opposed to the uniform distribution) and provide bounds on the occupancy of a row (and thus the theatre) in each case. Finally, we propose several open problems for other seating probability distributions and theatre seating arrangements.

Additional Metadata | |
---|---|

Keywords | (p-)Courteous, Geometric distribution, Row, Seat, Selfish, Theatre occupancy, Theatregoers, Uniform distribution, Zipf distribution |

Persistent URL | dx.doi.org/10.1016/j.tcs.2015.01.053 |

Journal | Theoretical Computer Science |

Citation |
Georgiou, K. (Konstantinos), Kranakis, E, & Krizanc, D. (Danny). (2015). Excuse me! or the courteous theatregoers' problem.
Theoretical Computer Science, 586, 95–110. doi:10.1016/j.tcs.2015.01.053 |