Abstract
Popular matchings have been intensively studied recently as a relaxed concept of stable matchings. By applying the concept of popular matchings to branchings in directed graphs, Kavitha et al. introduced popular branchings. In a directed graph \(G=(V_G,E_G)\), each vertex has preferences over its incoming edges. For branchings \(B_1\) and \(B_2\) in G, a vertex \(v\in V_G\) prefers \(B_1\) to \(B_2\) if v prefers its incoming edge of \(B_1\) to that of \(B_2\), where having an arbitrary incoming edge is preferred to having none, and \(B_1\) is more popular than \(B_2\) if the number of vertices that prefer \(B_1\) is greater than the number of vertices that prefer \(B_2\). A branching B is called a popular branching if there is no branching more popular than B. Kavitha et al. proposed an algorithm for finding a popular branching when the preferences of each vertex are given by a strict partial order. The validity of this algorithm is proved by utilizing classical theorems on the duality of weighted arborescences. In this paper, we generalize popular branchings to weighted popular branchings in vertex-weighted directed graphs in the same manner as weighted popular matchings by Mestre. We give an algorithm for finding a weighted popular branching, which extends the algorithm of Kavitha et al., when the preferences of each vertex are given by a total preorder and the weights satisfy certain conditions. Our algorithm includes elaborated procedures resulting from the vertex-weights, and its validity is proved by extending the argument of the duality of weighted arborescences.
The second author is supported by JSPS KAKENHI Grant Number JP20K11699, Japan.
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
References
Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37, 1030–1045 (2007)
Biró, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97–108. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13073-1_10
Cseh, Á., Huang, C.-C., Kavitha, T.: Popular matchings with two-sided preferences and one-sided ties. SIAM J. Discr. Math. 31(4), 2348–2377 (2017)
Cseh, Á., Kavitha, T.: Popular edges and dominant matchings. Math. Programm. 172(1), 209–229 (2017)
Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Stud. Integer Programm. Ann. Discr. Math. 185–204 (1977)
Frank, A.: Kernel systems of directed graphs. Acta Scientiarum Mathematicarum 41, 63–76 (1979)
Fulkerson, D.R.: Packing rooted directed cuts in a weighted directed graph. Math. Programm. 6(1), 1–13 (1974)
Fenza, Y., Kavitha, T.: Quasi-popular matchings, optimality, and extended formulations. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 325–344 (2020)
Gärdenfors, P.: Match making: assignments based on bilateral preferences. Behav. Sci. 20(3), 166–173 (1975)
Kavitha, T., Nasre, M.: Optimal popular matchings. Discr. Appl. Math. 157(14), 3181–3186 (2009)
Kavitha, T., Király, T., Matuschke, J., Schlotter, I., Schmidt-Kraepelin, U.: Popular branchings and their dual certificates. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 223–237. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-45771-6_18
Mestre, J.: Weighted popular matchings. ACM Trans. Algor. 10(1), 1–16 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Natsui, K., Takazawa, K. (2022). Finding Popular Branchings in Vertex-Weighted Digraphs. In: Mutzel, P., Rahman, M.S., Slamin (eds) WALCOM: Algorithms and Computation. WALCOM 2022. Lecture Notes in Computer Science(), vol 13174. Springer, Cham. https://doi.org/10.1007/978-3-030-96731-4_25
Download citation
DOI: https://doi.org/10.1007/978-3-030-96731-4_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-96730-7
Online ISBN: 978-3-030-96731-4
eBook Packages: Computer ScienceComputer Science (R0)