Allocating costs in set covering problems
暂无分享,去创建一个
Gustavo Bergantiños | Joaquín Sánchez-Soriano | Natividad Llorca | María Gómez-Rúa | Manuel A. Pulido | G. Bergantiños | J. Sánchez-Soriano | M. Gómez-Rúa | N. Llorca | M. Pulido
[1] Daniel Granot. The Role of Cost Allocation in Locational Models , 1987, Oper. Res..
[2] J. Beasley,et al. Enhancing an algorithm for set covering problems , 1992 .
[3] C. G. Bird,et al. On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.
[4] Vito Fragnelli,et al. Open Problems in Cooperative Location Games , 2013, IGTR.
[5] Justo Puerto,et al. On the core of a class of location games , 2001, Math. Methods Oper. Res..
[6] M. Gloria Fiestras-Janeiro,et al. Cooperative games and cost allocation problems , 2011 .
[7] Michel Grabisch,et al. Set Functions, Games and Capacities in Decision Making , 2016 .
[8] Toshihide Ibaraki,et al. Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..
[9] Charles S. ReVelle,et al. The Location of Emergency Service Facilities , 1971, Oper. Res..
[10] Joaquín Sánchez-Soriano,et al. The pairwise egalitarian solution , 2003, Eur. J. Oper. Res..
[11] Guillermo Owen,et al. On the core of linear production games , 1975, Math. Program..
[12] Xiang-Yang Li,et al. Cost sharing and strategyproof mechanisms for set cover games , 2005, J. Comb. Optim..
[13] Gustavo Bergantiños,et al. A new rule for source connection problems , 2014, Eur. J. Oper. Res..
[14] Arie Tamir,et al. On the Core of Cost Allocation Games Defined on Location Problems , 1993, Transp. Sci..
[15] Gustavo Bergantiños,et al. "Optimistic" weighted Shapley rules in minimum cost spanning tree problems , 2008, Eur. J. Oper. Res..
[16] M. Jackson,et al. Games on Networks , 2014 .
[17] Eitan Zemel,et al. Totally Balanced Games and Games of Flow , 1982, Math. Oper. Res..
[18] László A. Végh,et al. LP-Based Covering Games with Low Price of Anarchy , 2012, Theory of Computing Systems.
[19] H. Moulin,et al. Serial Cost Sharing , 1992 .
[20] Maria-Florina Balcan,et al. Near Optimality in Covering and Packing Games by Exposing Global Information , 2011, ArXiv.
[21] E. Kohlberg. On the Nucleolus of a Characteristic Function Game , 1971 .
[22] Jérôme Monnot,et al. On the Impact of Local Taxes in a Set Cover Game , 2010, SIROCCO.
[23] L. Shapley,et al. The assignment game I: The core , 1971 .
[24] Eitan Altman,et al. A survey on networking games in telecommunications , 2006, Comput. Oper. Res..
[25] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[26] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[27] Martin Hoefer,et al. Non-cooperative facility location and covering games , 2006, Theor. Comput. Sci..
[28] Gustavo Bergantiños,et al. A fair rule in minimum cost spanning tree problems , 2007, J. Econ. Theory.
[29] Alberto Caprara,et al. New techniques for cost sharing in combinatorial optimization games , 2010, Math. Program..
[30] Herbert Hamers,et al. Operations research games: A survey , 2001 .
[31] Joaquín Sánchez-Soriano,et al. Pairwise solutions and the core of transportation situations , 2006, Eur. J. Oper. Res..
[32] Nikhil R. Devanur,et al. Strategyproof cost-sharing mechanisms for set cover and facility location games , 2003, EC '03.
[33] Daniel J. Kleitman,et al. Cost allocation for a spanning tree , 1973, Networks.
[34] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[35] Sergio García,et al. Covering Location Problems , 2015 .
[36] Martin Skutella,et al. Cooperative facility location games , 2000, SODA '00.
[37] Michel Grabisch,et al. A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid , 2010, Ann. Oper. Res..