Sequential Elimination for Group Assessment in Coalitional Games

Prelegent(ci)

Oskar Skibski

Afiliacja

University of Warsaw

Język referatu

angielski

Termin

5 marca 2026 12:15

Pokój

p. 4060

Seminarium

Seminarium „Ekonomia algorytmiczna”

---

Two straightforward methods to extend an assessment of individual elements to groups are to sum individual assessments or to treat the group as a single merged element and assess it accordingly. In this work, we analyze another natural approach based on sequential elimination: elements of the group are removed one by one, and their assessments are aggregated. We study this approach in the context of coalitional games and show that, for almost all semivalues, it does not depend on the order of players. We show that the Union Shapley value is a special case of this approach.

---