Biró, Péter, and Csáji, Gergely. Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Retrieved from https://par.nsf.gov/biblio/10514358. Games and Economic Behavior 145.C Web. doi:10.1016/j.geb.2024.03.010.

Biró, Péter, & Csáji, Gergely. Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains. Games and Economic Behavior, 145 (C). Retrieved from https://par.nsf.gov/biblio/10514358. https://doi.org/10.1016/j.geb.2024.03.010

Biró, Péter, and Csáji, Gergely. "Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains". Games and Economic Behavior 145 (C). Country unknown/Code not available: Games and Economic Behavior. https://doi.org/10.1016/j.geb.2024.03.010. https://par.nsf.gov/biblio/10514358.

@article{osti_10514358,
place = {Country unknown/Code not available}, title = {Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains}, url = {https://par.nsf.gov/biblio/10514358}, DOI = {10.1016/j.geb.2024.03.010}, abstractNote = {}, journal = {Games and Economic Behavior}, volume = {145}, number = {C}, publisher = {Games and Economic Behavior}, author = {Biró, Péter and Csáji, Gergely}, }