Advertisement

Multi-objective stable matching and distributional constraints

  • Mangesh GharoteEmail author
  • Nitin Phuke
  • Rahul Patil
  • Sachin Lodha
Focus
  • 44 Downloads

Abstract

In this paper, we study a centralized matching scheme that has to assign a set of agents to a set of jobs by meeting distributional constraints. The scheme has to maximize social welfare and fairness offered by the matching to the parties. Furthermore, the allocation needs to minimize the number of blocking pairs. The problem is NP-hard and hence computationally challenging. Nonetheless, the users expect good solutions that can be generated quickly. We propose linear programming-based improvement heuristics to solve this multi-criteria stable matching problem. Our approach finds an equitable and global welfare stable matching solution in significantly lesser time. We then demonstrate the applicability of our proposed model and the solution methodology in a workforce allocation problem faced by software projects.

Keywords

Multi-objective Stable matching Goal programming Workforce allocation Heuristics Repair Distributional constraints 

Notes

Compliance with ethical standards

Conflict of interest

The authors have declared that no conflicts of interest exist.

Informed consent

Informed consent was obtained from all individual participants included in the study.

Ethical approval

All procedures performed in studies involving human participants were in accordance with the ethical standards of the institutional and/or national research committee and with the 1964 Helsinki Declaration and its later amendments or comparable ethical standards.

References

  1. Abdulkadiroğlu A, Pathak PA, Roth AE (2005) The New York city high school match. Am Econ Rev 95(2):364–367CrossRefGoogle Scholar
  2. Abdulkadiroğlu A, Sönmez T (2003) School choice: a mechanism design approach. Am Econ Rev 93(3):729–747CrossRefGoogle Scholar
  3. Anshelevich E, Das S, Naamad Y (2009) Anarchy, stability, and utopia: creating better matchings. In: International symposium on algorithmic game theory. Springer, pp 159–170Google Scholar
  4. Anshelevich E, Das S, Naamad Y (2013) Anarchy, stability, and utopia: creating better matchings. Auton Agents Multi-Agent Syst 26(1):120–140CrossRefzbMATHGoogle Scholar
  5. Axtell RL, Kimbrough SO (2008) The high cost of stability in two-sided matching: how much social welfare should be sacrificed in the pursuit of stability. In: Proceedings of the 2008 world congress on social simulation (WCSS-08)Google Scholar
  6. Azevedo EM, Budish E (2017) Strategy-proofness in the large. Technical Report, National Bureau of Economic ResearchGoogle Scholar
  7. Biró P, Fleiner T, Irving RW, Manlove DF (2010) The college admissions problem with lower and common quotas. Theor Comput Sci 411(34–36):3136–3153MathSciNetCrossRefzbMATHGoogle Scholar
  8. Boudreau JW, Knoblauch V (2010) Marriage matching and intercorrelation of preferences. J Public Econ Theory 12(3):587–602CrossRefGoogle Scholar
  9. Boudreau JW, Knoblauch V (2013) Preferences and the price of stability in matching markets. Theory Decis 74(4):565–589MathSciNetCrossRefzbMATHGoogle Scholar
  10. Boudreau JW, Knoblauch V (2014) What price stability? Social welfare in matching markets. Math Soc Sci 67:27–33MathSciNetCrossRefzbMATHGoogle Scholar
  11. Caldarelli G, Capocci A (2001) Beauty and distance in the stable marriage problem. Phys A Stat Mech Appl 300(1–2):325–331CrossRefzbMATHGoogle Scholar
  12. Celik OB, Knoblauch V (2007) Marriage matching and intercorrelation of preferences. Economics Working Papers, 200716Google Scholar
  13. Charnes A, Cooper WW (1977) Goal programming and multiple objective optimizations: Part 1. Eur J Oper Res 1(1):39–54CrossRefzbMATHGoogle Scholar
  14. Deb K (1999) Solving goal programming problems using multi-objective genetic algorithms. In: Proceedings of the 1999 congress on evolutionary computation, CEC 99, vol 1. IEEE, pp 77–84Google Scholar
  15. Ehlers L, Hafalir IE, Yenmez MB, Yildirim MA (2014) School choice with controlled choice constraints: hard bounds versus soft bounds. J Econ Theory 153:648–683MathSciNetCrossRefzbMATHGoogle Scholar
  16. Erdil A, Ergin H (2008) What’s the matter with tie-breaking? Improving efficiency in school choice. Am Econ Rev 98(3):669–89CrossRefGoogle Scholar
  17. Eriksson K, Häggström O (2008) Instability of matchings in decentralized markets with various preference structures. Int J Game Theory 36(3–4):409–420MathSciNetCrossRefzbMATHGoogle Scholar
  18. Fan Z-P, Li M-Y, Zhang X (2017) Satisfied two-sided matching: a method considering elation and disappointment of agents. Soft Comput 22:1–15Google Scholar
  19. Fırat M, Hurkens C, Laugier A (2014) Stable multi-skill workforce assignments. Ann Oper Res 213(1):95–114MathSciNetCrossRefzbMATHGoogle Scholar
  20. Fragiadakis D, Troyan P (2017) Improving matching under hard distributional constraints. Theor Econ 12(2):863–908MathSciNetCrossRefzbMATHGoogle Scholar
  21. Gale D, Shapley LS (1962) College admissions and the stability of marriage. Am Math Mon 69(1):9–15MathSciNetCrossRefzbMATHGoogle Scholar
  22. Gelain M, Pini MS, Rossi F, Venable KB, Walsh T (2010) Local search for stable marriage problems with ties and incomplete lists. In: Pacific rim international conference on artificial intelligence. Springer, pp 64–75Google Scholar
  23. Gelain M, Pini MS, Rossi F, Venable KB, Walsh T (2013) Local search approaches in stable matching problems. Algorithms 6(4):591–617MathSciNetCrossRefGoogle Scholar
  24. Gent IP, Prosser P (2002) An empirical study of the stable marriage problem with ties and incomplete lists. In: Proceedings of the 15th European conference on artificial intelligence. IOS Press, pp 141–145Google Scholar
  25. Gharote M, Patil R, Lodha S (2017a) Scatter search for trainees to software project requirements stable allocation. J Heuristics 23(4):257–283CrossRefGoogle Scholar
  26. Gharote M, Patil R, Lodha S, Ram an R (2015) Assignment of trainees to software project requirements: a stable matching based approach. Comput Ind Eng 87:228–237CrossRefGoogle Scholar
  27. Gharote M, Phuke N, Patil R, Lodha S (2017b) Stable matching with multi-objectives: a goal programming approach. In: International conference on optimization and decision science. Springer, pp 325–334Google Scholar
  28. Giannakopoulos I, Karras P, Tsoumakos D, Doka K, Koziris N (2015) An equitable solution to the stable marriage problem. In: 2015 IEEE 27th International Conference on tools with artificial intelligence (ICTAI). IEEE, pp 989–996Google Scholar
  29. Haas C (2014) Incentives and two-sided matching-engineering coordination mechanisms for social clouds, vol 12. KIT Scientific Publishing, KarlsruheGoogle Scholar
  30. Haas C, Kimbrough SO, Caton S, Weinhardt C (2013)Preference-based resource allocation: using heuristics to solve two-sided matching problems with indifferences. In: International conference on grid economics and business models. Springer, pp 149–160Google Scholar
  31. Irving RW (1994) Stable marriage and indifference. Discrete Appl Math 48(3):261–272MathSciNetCrossRefzbMATHGoogle Scholar
  32. Irving RW, Leather P, Gusfield D (1987) An efficient algorithm for the “optimal” stable marriage. J ACM (JACM) 34(3):532–543MathSciNetCrossRefGoogle Scholar
  33. Iwama K, Miyazaki S, Morita Y, Manlove D (1999) Stable marriage with incomplete lists and ties. In: International colloquium on automata, languages, and programming. Springer, pp 443–452Google Scholar
  34. Jahanshahloo GR, Afzalinejad M (2008) Goal programming in the context of the assignment problem and a computationally effective solution method. Appl Math Comput 200(1):34–40MathSciNetzbMATHGoogle Scholar
  35. Kamada Y, Kojima F (2014) Efficient matching under distributional constraints: theory and applications. Am Econ Rev 105(1):67–99CrossRefGoogle Scholar
  36. Kamada Y, Kojima F (2017a) Efficient matching under distributional constraints: theory and applications. J Econ Theory 168:107–149CrossRefzbMATHGoogle Scholar
  37. Kamada Y, Kojima F (2017b) Recent developments in matching with constraints. Am Econ Rev 107(5):200–204CrossRefGoogle Scholar
  38. Kamada Y, Kojima F (2018) Stability and strategy-proofness for matching with constraints: a necessary and sufficient condition. Theor Econ 13(2):761–793MathSciNetCrossRefzbMATHGoogle Scholar
  39. Kim JY, Altinkemer K, Bisi A (2012) Yield management of workforce for it service providers. Decis Support Syst 53(1):23–33CrossRefGoogle Scholar
  40. Kimbrough SO, Kuo A (2010) On heuristics for two-sided matching: Revisiting the stable marriage problem as a multiobjective problem. In: Proceedings of the 12th annual conference on genetic and evolutionary computation. ACM, pp 1283–1290Google Scholar
  41. Klaus B, Klijn F (2006) Procedurally fair and stable matching. Econ Theory 27(2):431–447MathSciNetCrossRefzbMATHGoogle Scholar
  42. Lee S (2016) Incentive compatibility of large centralized matching markets. Rev Econ Stud 84(1):444–463MathSciNetCrossRefGoogle Scholar
  43. Masarani F, Gokturk SS (1989) On the existence of fair matching algorithms. Theory Decis 26(3):305–322MathSciNetCrossRefzbMATHGoogle Scholar
  44. Nasre M, Nimbhorkar P (2017) Popular matchings with lower quotas. arXiv preprint arXiv:1704.07546
  45. Phuke N, Gharote M, Patil R, Lodha S (2017) Multi-objective stable matching with ties. In: 2017 IEEE international conference on industrial engineering and engineering management (IEEM), pp 964–968Google Scholar
  46. Rezaei J (2015) A two-way approach to supply chain partner selection. Int J Prod Res 53(16):4888–4902CrossRefGoogle Scholar
  47. Roth AE (1982) The economics of matching: stability and incentives. Math Oper Res 7(4):617–628MathSciNetCrossRefzbMATHGoogle Scholar
  48. Roth AE (1984) The evolution of the labor market for medical interns and residents: a case study in game theory. J Polit Econ 92(6):991–1016CrossRefGoogle Scholar
  49. Tamiz M, Jones D, Romero C (1998) Goal programming for decision making: an overview of the current state-of-the-art. Eur J Oper Res 111(3):569–581CrossRefzbMATHGoogle Scholar
  50. Unsworth C, Prosser P (2005) Specialised constraints for stable matching problems. Lecture notes in computer science, vol 3709. Springer, Berlin, p 869Google Scholar
  51. Vate JHV (1989) Linear programming brings marital bliss. Oper Res Lett 8(3):147–153MathSciNetCrossRefzbMATHGoogle Scholar
  52. Vien NA, Chung T (2006) Multiobjective fitness functions for stable marriage problem using genetic algorithm. In: SICE-ICASE, 2006. International joint conference. IEEE, pp 5500–5503Google Scholar
  53. Young HP (1994) Cost allocation—handbook of game theory with economic applications, vol II. North-Holland, AmsterdamGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Tata Consultancy Services, TCS Research TRDDCPuneIndia
  2. 2.SJM School of ManagementIIT BombayPowai, MumbaiIndia

Personalised recommendations