This research paper proves the existence of envy-free up to any good (EFX) allocations for any number of agents when there are at most three types of additive valuations.
While envy-free allocations are generally hard to find, graphical valuations offer a structured approach where envy-freeness can be achieved efficiently in some cases, but with potential trade-offs in welfare maximization, particularly as valuations become more complex.
본 논문에서는 그래픽 평가에서 부러움 없는(EF) 할당과 부러움 없는 품목 할당(EFX)의 효율성 및 계산 복잡성을 분석하여, 특정 조건에서 EF 및 EFX 할당을 찾는 문제의 어려움과 가능성을 제시합니다.