Cost allocation for set covering : the happy nucleolus
Year of publication: |
2024
|
---|---|
Authors: | Blauth, Jannis ; Ellerbrock, Antonia ; Traub, Vera ; Vygen, Jens |
Published in: |
Operations research letters : a journal of INFORMS devoted to the rapid publication of concise contributions in operations research. - Amsterdam [u.a.] : Elsevier Science, ISSN 0167-6377, ZDB-ID 1467065-3. - Vol. 57.2024, Art.-No. 107158, p. 1-8
|
Subject: | Cooperative game theory | Cost allocation | Happy nucleolus | Set covering | Spieltheorie | Game theory | Kooperatives Spiel | Cooperative game | Zufriedenheit | Satisfaction | Core | Kostenverrechnung |
-
Core-based cost allocation in the cooperative traveling salesman problem
Kimms, Alf, (2015)
-
Capacity sharing and cost allocation among independent firms with congestion
Yu, Yimin, (2015)
-
Verdonck, Lotte, (2016)
- More ...
-
An improved upper bound on the integrality ratio for the s-t-path TSP
Traub, Vera, (2019)
-
Layers and matroids for the traveling salesman's paths
Schalekamp, Frans, (2018)
-
Improving on best-of-many-christofides for T-tours
Traub, Vera, (2020)
- More ...