Optimal Apartment Cleaning by Harried College Students: A Game-Theoretic Analysis

HTML  XML Download Download as PDF (Size: 256KB)  PP. 1255-1260  
DOI: 10.4236/tel.2017.75085    784 Downloads   1,371 Views  Citations

ABSTRACT

In this note, we use a simple game model to analyze the optimal cleanup of an apartment that is shared by nN college students who are pressed for time. From an individual standpoint, these students dislike cleaning. However, they also prefer a clean apartment to a dirty one. Hence, for any student i, where i =1,…n, this student’s utility is the total number of hours spent by all the n students cleaning less a threshold d times the hours spent cleaning by himself. In this setting, we first determine the Nash equilibrium cleanup times when the threshold d is less than unity. Second, we find the Nash equilibrium cleanup times when the threshold d is greater than unity. Finally, for specific values of n and the threshold d, we investigate whether the second Nash equilibrium is Pareto efficient.

Share and Cite:

Batabyal, A. (2017) Optimal Apartment Cleaning by Harried College Students: A Game-Theoretic Analysis. Theoretical Economics Letters, 7, 1255-1260. doi: 10.4236/tel.2017.75085.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.