L.S. Shapley. On balanced sets and cores. Naval Research Logistics Quaterly, 14:453--460. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (8 citations) (Correct)
.... j) #(I, j) c(I) The connection between the linear programming dual and cost sharing is well known, and has been used to build core and approximate core allocations for various problems, including facility location [7, 14] and TSP games [12] In fact, the classic Bondareva Shapley theorem [6, 31] implies that for so called covering games (in which the cost c # ( is given by the minimum cost solution to a covering integer program) the core is nonempty if and only if the linear relaxation of the game defining IP has no integrality gap. Moulin and Shenker [29] show that cross monotonic ....
L.S. Shapley. On balanced sets and cores. Naval Research Logistics Quaterly, 14:453--460.
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (8 citations) (Correct)
No context found.
L.S. Shapley. On balanced sets and cores. Naval Research Logistics Quaterly, 14:453--460.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC