supported by the National Key R&D Program of China(No.2022YFE0196100);the Guangxi Key Laboratory of Cryptography and Information Security(No.GCIS202116);the Fundamental Research Project of Shenzhen City(No.JCYJ20210324102012033);the Shenzhen Science and Technology Program(No.CJGJZD20210408092806017);the National Natural Science Foundation of China(Nos.12371321 and 12071460).
In this paper,we investigate the stable matching problem with multiple preferences in bipartite graphs,where each agent has various preference lists for all available partners with respect to different criteria.The pr...