Round-robin item allocation (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Round-robin item allocation" in English language version.

refsWebsite

Global rank English rank

2^nd place

69^th place

59^th place

1,185^th place

840^th place

11^th place

8^th place

2,948^th place

1,879^th place

149^th place

178^th place

5^th place

low place

acm.org

Biswas, Arpita; Barman, Siddharth (2018-07-13). "Fair division under cardinality constraints". Proceedings of the 27th International Joint Conference on Artificial Intelligence. IJCAI'18. Stockholm, Sweden: AAAI Press: 91–97. arXiv:1804.09521. ISBN 978-0-9992411-2-7.
Chakraborty, Mithun; Igarashi, Ayumi; Suksompong, Warut; Zick, Yair (2021-08-16). "Weighted Envy-freeness in Indivisible Item Allocation". ACM Transactions on Economics and Computation. ACm: 1–39.
Xiaowei Wu, Cong Zhang, Shengwei Zhou (2023). "Weighted EF1 Allocations for Indivisible Chores". EC 2023conference.{{cite web}}: CS1 maint: multiple names: authors list (link)

Brustle, Johannes; Dippel, Jack; Narayan, Vishnu V.; Suzuki, Mashbat; Vetta, Adrian (2020-07-13). "One Dollar Each Eliminates Envy". Proceedings of the 21st ACM Conference on Economics and Computation. EC '20. Virtual Event, Hungary: Association for Computing Machinery. pp. 23–39. arXiv:1912.02797. doi:10.1145/3391403.3399447. ISBN 978-1-4503-7975-5. S2CID 208637311.
Segal-Halevi, Erel; Suksompong, Warut (2019-12-01). "Democratic fair allocation of indivisible goods". Artificial Intelligence. 277: 103167. arXiv:1709.02564. doi:10.1016/j.artint.2019.103167. ISSN 0004-3702. S2CID 203034477.
Biswas, Arpita; Barman, Siddharth (2018-07-13). "Fair division under cardinality constraints". Proceedings of the 27th International Joint Conference on Artificial Intelligence. IJCAI'18. Stockholm, Sweden: AAAI Press: 91–97. arXiv:1804.09521. ISBN 978-0-9992411-2-7.

Caragiannis, Ioannis; Kurokawa, David; Moulin, Hervé; Procaccia, Ariel D.; Shah, Nisarg; Wang, Junxing (2016). The Unreasonable Fairness of Maximum Nash Welfare (PDF). Proceedings of the 2016 ACM Conference on Economics and Computation - EC '16. p. 305. doi:10.1145/2940716.2940726. ISBN 9781450339360.
Brustle, Johannes; Dippel, Jack; Narayan, Vishnu V.; Suzuki, Mashbat; Vetta, Adrian (2020-07-13). "One Dollar Each Eliminates Envy". Proceedings of the 21st ACM Conference on Economics and Computation. EC '20. Virtual Event, Hungary: Association for Computing Machinery. pp. 23–39. arXiv:1912.02797. doi:10.1145/3391403.3399447. ISBN 978-1-4503-7975-5. S2CID 208637311.
Segal-Halevi, Erel; Suksompong, Warut (2019-12-01). "Democratic fair allocation of indivisible goods". Artificial Intelligence. 277: 103167. arXiv:1709.02564. doi:10.1016/j.artint.2019.103167. ISSN 0004-3702. S2CID 203034477.

Caragiannis, Ioannis; Kurokawa, David; Moulin, Hervé; Procaccia, Ariel D.; Shah, Nisarg; Wang, Junxing (2016). The Unreasonable Fairness of Maximum Nash Welfare (PDF). Proceedings of the 2016 ACM Conference on Economics and Computation - EC '16. p. 305. doi:10.1145/2940716.2940726. ISBN 9781450339360.

Haris Aziz, Ioannis Caragiannis, Ayumi Igarashi, Toby Walsh (2019). "Fair Allocation of Indivisible Goods and Chores" (PDF). IJCAI 2019 conference.{{cite web}}: CS1 maint: multiple names: authors list (link)

Brustle, Johannes; Dippel, Jack; Narayan, Vishnu V.; Suzuki, Mashbat; Vetta, Adrian (2020-07-13). "One Dollar Each Eliminates Envy". Proceedings of the 21st ACM Conference on Economics and Computation. EC '20. Virtual Event, Hungary: Association for Computing Machinery. pp. 23–39. arXiv:1912.02797. doi:10.1145/3391403.3399447. ISBN 978-1-4503-7975-5. S2CID 208637311.
Segal-Halevi, Erel; Suksompong, Warut (2019-12-01). "Democratic fair allocation of indivisible goods". Artificial Intelligence. 277: 103167. arXiv:1709.02564. doi:10.1016/j.artint.2019.103167. ISSN 0004-3702. S2CID 203034477.