Abstract
The model of a housing market, introduced by Shapley and Scarf in 1974 [14], captures a fundamental situation in an economy where each agent owns exactly one unit of some indivisible good: a house. We focus on an extension of this model where duplicate houses may exist. As opposed to the classical setting, the existence of an economical equilibrium is no longer ensured in this case. Here, we study the deficiency of housing markets with duplicate houses, a notion measuring how close a market can get to an economic equilibrium. We investigate the complexity of computing the deficiency of a market, both in the classical sense and also in the context of parameterized complexity.
We show that computing the deficiency is NP-hard even under several severe restrictions placed on the housing market, and thus we consider different parameterizations of the problem. We prove W[1]-hardness for the case where the parameter is the value of the deficiency we aim for. By contrast, we provide an FPT algoritm for computing the deficiency of the market, if the parameter is the number of different house types.
This work was supported by the VEGA grants 1/0035/09 and 1/0325/10 (Cechlárová), by the Hungarian National Research Fund OTKA 67651 (Schlotter) and by the Slovak-Hungarian APVV grant SK-HU-003-08.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abdulkadiroǧlu, A., Pathak, P.A., Roth, A.E.: Strategy-proofness versus efficiency in matching with indifferences: Redesigning the NYC high school match. American Economic Review 99(5), 1954–1978 (2009)
Arrow, K.J., Debreu, G.: Existence of an equilibrium for a competitive economy. Econometrica 22(3), 265–290 (1954)
Biró, P., Manlove, D.F., Rizzi, R.: Maximum weight cycle packing in optimal kidney exchange programs. Technical Report TR-2009-298, University of Glasgow, Department of Computing Science (2009)
Cechlárová, K., Fleiner, T.: Housing markets through graphs. Algorithmica 58, 19–33 (2010)
Cechlárová, K., Jelínková, E.: An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses. Technical Report IM Preprint series A, no. 2/2010, P.J. Šafárik University, Faculty of Science, Institute of Mathematics (2010)
Deng, X., Papadimitriou, C., Safra, S.: On the complexity of equilibria. In: STOC 2002: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 67–71. ACM, New York (2002)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fekete, S.P., Skutella, M., Woeginger, G.J.: The complexity of economic equilibria for house allocation markets. Inform. Process. Lett. 88(5), 219–223 (2003)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Kao, M.-Y., Lam, T.-W., Sung, W.-K., Ting, H.-F.: A decomposition theorem for maximum weight bipartite matchings with applications to evolutionary trees. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 438–449. Springer, Heidelberg (1999)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Roth, A.E., Sönmez, T., Ünver, M.U.: Kidney exchange. Quarterly J. of Econ. 119, 457–488 (2004)
Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1, 23–37 (1974)
Sönmez, T., Ünver, M.U.: House allocation with existing tenants: an equivalence. Games and Economic Behavior 52, 153–185 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cechlárová, K., Schlotter, I. (2010). Computing the Deficiency of Housing Markets with Duplicate Houses. In: Raman, V., Saurabh, S. (eds) Parameterized and Exact Computation. IPEC 2010. Lecture Notes in Computer Science, vol 6478. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17493-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-17493-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17492-6
Online ISBN: 978-3-642-17493-3
eBook Packages: Computer ScienceComputer Science (R0)