Envy-free matchings in bipartite graphs and their applications to fair division-Reference-Cited by-同舟云学术

Envy-free matchings in bipartite graphs and their applications to fair division

Published:2022-03 Issue: Volume:587 Page:164-187
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Aigner-Horev Elad,Segal-Halevi Erel

Funder

Israel Science Foundation

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference41 articles.

1. S. Alaei, K. Jain, A. Malekian, Competitive Equilibria in Two Sided Matching Markets with Non-transferable Utilities, arXiv preprint 1006.4696, 2012.

2. Approximation algorithms for computing maximin share allocations;Amanatidis;ACM Trans. Algorithms,2017

3. S. Avvakumov, R. Karasev, Equipartition of a segment, arXiv preprint arXiv:2009.09862.

4. H. Aziz, S. Gaspers, S. Mackenzie, T. Walsh, Fair assignment of indivisible objects under ordinal preferences, Artif. Intell. 227 (2015) 71–92, ISSN 00043702, arXiv preprint 1312.6546.

5. M. Babaioff, N. Nisan, I. Talgam-Cohen, Competitive Equilibria with Indivisible Goods and Generic Budgets, arXiv preprint 1703.08150 v1 (2017–03), 2017.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unsupervised feature selection based on bipartite graph and low-redundant regularization;Knowledge-Based Systems;2024-10

2. Graphical house allocation with identical valuations;Autonomous Agents and Multi-Agent Systems;2024-08-28

3. Improved Truthful Rank Approximation for Rank-Maximal Matchings;Web and Internet Economics;2023-12-31

4. A Survey on Fair Allocation of Chores;Mathematics;2023-08-21

5. Min-Max Optimal Matching;2023 IEEE Integrated STEM Education Conference (ISEC);2023-03-11