Abstract
The Stable Matching problem was introduced by Gale and Shapley in 1962. The input for the stable matching problem is a complete bipartite K n,n graph together with a ranking for each node. Its output is a matching that does not contain a blocking pair, where a blocking pair is a pair of elements that are not matched together but rank each other higher than they rank their current mates. In this work we study the Distributed Weighted Stable Matching problem. The input to the Weighted Stable Matching problem is a complete bipartite K n,n graph and a weight function W. The ranking of each node is determined by W, i.e. node v prefers node u 1 over node u 2 if W((v,u 1)) > W((v, u 2)). Using this ranking we can solve the original Stable Matching problem. We consider two different communication models: the billboard model and the full distributed model. In the billboard model, we assume that there is a public billboard and each participant can write one message on it in each time step. In the distributed model, we assume that each node can send O(logn) bits on each edge of the K n,n . In the billboard model we prove a somewhat surprising tight bound: any algorithm that solves the Stable Matching problem requires at least n − 1 rounds. We provide an algorithm that meets this bound. In the distributed communication model we provide an algorithm named intermediation agencies algorithm, in short (IAA), that solves the Distributed Weighted Stable Marriage problem in \(O(\sqrt{n})\) rounds. This is the first sub-linear distributed algorithm that solves some subcase of the general Stable Marriage problem.
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
Gale, D., Shapley, L.S.: College admissions and the stability of marriage. The American Mathematical Monthly 69, 9–15 (1962)
Gusfield, D., Irving, R.W.: The stable marriage problem: structure and algorithms. MIT Press, Cambridge (1989)
Nakamura, M., Onaga, K., Kyan, S., Silva, M.: A genetic algorithm for sex-fair stable marriage problem. In: ISCAS, pp. 509–512 (1995)
Brito, I., Meseguer, P.: Distributed stable matching problems with ties and incomplete lists. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 675–679. Springer, Heidelberg (2006)
Lu, E., Zheng, S.Q.: A parallel iterative improvement stable matching algorithm. In: Pinkston, T.M., Prasanna, V.K. (eds.) HiPC 2003. LNCS (LNAI), vol. 2913, pp. 55–65. Springer, Heidelberg (2003)
Feder, T., Megiddo, N., Plotkin, S.A.: A sublinear parallel algorithm for stable matching. In: SODA 1994: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA. Society for Industrial and Applied Mathematics, pp. 632–637 (1994)
Kipnis, A., Patt-Shamir, B.: A note on distributed stable matching. In: ICDCS, pp. 466–473. IEEE Computer Society, Los Alamitos (2009)
Chuang, S., Goel, A., McKeown, N., Prabhakar, B.: Matching output queueing with a combined input output queued switch. Technical report, Stanford, CA, USA (1998)
McKeown, N.: The islip scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw. 7, 188–201 (1999)
Banovic, D., Radusinovic, I.: Scheduling algorithm for voq switches. AEU - International Journal of Electronics and Communications 62, 455–458 (2008)
Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discrete Applied Mathematics 156, 2959–2977 (2008)
Awerbuch, B., Patt-Shamir, B., Peleg, D., Tuttle, M.: Collaboration of untrusting peers with changing interests. In: Proceedings of the 5th ACM conference on Electronic commerce, pp. 112–119. ACM, New York (2004)
Awerbuch, B., Hayes, T.P.: Online collaborative filtering with nearly optimal dynamic regret. In: Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, pp. 315–319. ACM, New York (2007)
Awerbuch, B., Kleinberg, R.: Competitive collaborative learning. J. Comput. Syst. Sci. 74, 1271–1288 (2008)
Awerbuch, B., Azar, Y., Lotker, Z., Patt-Shamir, B., Tuttle, M.R.: Collaborate with strangers to find own preferences. In: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 263–269. ACM, New York (2005)
henk Hoepman, J.: Simple distributed weighted matchings. In: eprint cs.DC/0410047 (2004)
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
Amira, N., Giladi, R., Lotker, Z. (2010). Distributed Weighted Stable Marriage Problem. In: Patt-Shamir, B., Ekim, T. (eds) Structural Information and Communication Complexity. SIROCCO 2010. Lecture Notes in Computer Science, vol 6058. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-13284-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13283-4
Online ISBN: 978-3-642-13284-1
eBook Packages: Computer ScienceComputer Science (R0)