2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT) 2021
DOI: 10.1109/acait53529.2021.9731163
|View full text |Cite
|
Sign up to set email alerts
|

Minimal-envy Conference Paper Assignment: Formulation and a Fast Iterative Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Thus, a number of works has explored the idea of assignment fairness, aiming at producing more balanced assignments (Kobren et al, 2019;Stelmakh et al, 2021). Finally, other works explore the ideas of envy-freeness (Tan et al, 2021;Payan, 2022), resistance to lone-wolf strategic behavior (Xu et al, 2019;Dhull et al, 2022), and encouraging various types of diversity (Li et al, 2015;Leyton-Brown et al, 2022).…”
Section: Evaluation Of Similarity-computation Algorithmsmentioning
confidence: 99%
“…Thus, a number of works has explored the idea of assignment fairness, aiming at producing more balanced assignments (Kobren et al, 2019;Stelmakh et al, 2021). Finally, other works explore the ideas of envy-freeness (Tan et al, 2021;Payan, 2022), resistance to lone-wolf strategic behavior (Xu et al, 2019;Dhull et al, 2022), and encouraging various types of diversity (Li et al, 2015;Leyton-Brown et al, 2022).…”
Section: Evaluation Of Similarity-computation Algorithmsmentioning
confidence: 99%