Sharing Supermodular Costs
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.1100.0841
Download full text from publisher
References listed on IDEAS
- Maniquet, Francois, 2003.
"A characterization of the Shapley value in queueing problems,"
Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
- Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- MANIQUET, François, 2003. "A characterization of the Shapley value in queueing problems," LIDAM Reprints CORE 1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Ehud Kalai & Eitan Zemel, 1982.
"Totally Balanced Games and Games of Flow,"
Mathematics of Operations Research, INFORMS, vol. 7(3), pages 476-478, August.
- Ehud Kalai & Eitan Zemel, 1980. "On Totally Balanced Games and Games of Flow," Discussion Papers 413, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Debasis Mishra & Bharath Rangarajan, 2007.
"Cost sharing in a job scheduling problem,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
- MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," LIDAM Discussion Papers CORE 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Walter Kern & Daniël Paulusma, 2003. "Matching Games: The Least Core and the Nucleolus," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 294-308, May.
- M. Maschler & B. Peleg & L. S. Shapley, 1979. "Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts," Mathematics of Operations Research, INFORMS, vol. 4(4), pages 303-338, November.
- Hartman, Bruce C. & Dror, Moshe & Shaked, Moshe, 2000. "Cores of Inventory Centralization Games," Games and Economic Behavior, Elsevier, vol. 31(1), pages 26-49, April.
- Ulrich Faigle & Walter Kern & Daniël Paulusma, 2000. "Note on the computational complexity of least core concepts for min-cost spanning tree games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(1), pages 23-38, September.
- Jeroen Kuipers & Ulrich Faigle & Walter Kern, 2001. "On the computation of the nucleolus of a cooperative game," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(1), pages 79-98.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Lindong Liu & Xiangtong Qi & Zhou Xu, 2024. "Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 635-656, March.
- Uhan, Nelson A., 2015. "Stochastic linear programming games with concave preferences," European Journal of Operational Research, Elsevier, vol. 243(2), pages 637-646.
- Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
- Michela Chessa & Nobuyuki Hanaki & Aymeric Lardon & Takashi Yamada, 2022. "An experiment on the Nash program: Comparing two strategic mechanisms implementing the Shapley value," ISER Discussion Paper 1175, Institute of Social and Economic Research, Osaka University.
- Chessa, Michela & Hanaki, Nobuyuki & Lardon, Aymeric & Yamada, Takashi, 2023.
"An experiment on the Nash program: A comparison of two strategic mechanisms implementing the Shapley value,"
Games and Economic Behavior, Elsevier, vol. 141(C), pages 88-104.
- Michela Chessa & Nobuyuki Hanaki & Aymeric Lardon & Takashi Yamada, 2022. "An Experiment on The Nash Program: A Comparison of Two Strategic Mechanisms Implementing the Shapley Value," ISER Discussion Paper 1175r, Institute of Social and Economic Research, Osaka University, revised Feb 2023.
- Michela Chessa & Nobuyuki Hanaki & Aymeric Lardon & Takashi Yamada, 2023. "An experiment on the Nash program: A comparison of two strategic mechanisms implementing the Shapley value," Post-Print hal-04194465, HAL.
- Simai He & Jiawei Zhang & Shuzhong Zhang, 2012. "Polymatroid Optimization, Submodularity, and Joint Replenishment Games," Operations Research, INFORMS, vol. 60(1), pages 128-137, February.
- Kenneth Judd & Garrett van Ryzin, 2010. "Preface to the Special Issue on Computational Economics," Operations Research, INFORMS, vol. 58(4-part-2), pages 1035-1036, August.
- Lindong Liu & Yuqian Zhou & Zikang Li, 2022. "Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(1), pages 81-99, February.
- Lindong Liu & Xiangtong Qi & Zhou Xu, 2016. "Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 687-702, November.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Lindong Liu & Xiangtong Qi & Zhou Xu, 2016. "Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 687-702, November.
- Walter Kern & Daniël Paulusma, 2009. "On the Core and f -Nucleolus of Flow Games," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 981-991, November.
- Péter Biró & Walter Kern & Daniël Paulusma, 2012.
"Computing solutions for matching games,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
- Peter Biro & Walter Kern & Daniel Paulusma, 2011. "Computing Solutions for Matching Games," CERS-IE WORKING PAPERS 1142, Institute of Economics, Centre for Economic and Regional Studies.
- Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
- Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
- Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
- René Brink & Youngsub Chun, 2012.
"Balanced consistency and balanced cost reduction for sequencing problems,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 519-529, March.
- Rene van den Brink & Youngsub Chun, 2010. "Balanced Consistency and Balanced Cost Reduction for Sequencing Problems," Tinbergen Institute Discussion Papers 10-035/1, Tinbergen Institute.
- Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013.
"Stability and fairness in models with a multiple membership,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
- Michel Le Breton & Juan D. Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2010. "Stability and Fairness in Models with a Multiple Membership," Working Papers 10.16, Universidad Pablo de Olavide, Department of Economics.
- LEBRETON, Michel & MORENO-TERNERO, Juan D. & SAVVATEEV, Alexei & Weber, Shlomo, 2013. "Stability and fairness in models with a multiple membership," LIDAM Reprints CORE 2540, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Le Breton, Michel & Moreno-Ternero, Juan D. & Savvateev, Alexei & Weber, Shlomo, 2012. "Stability and Fairness in Models with a Multiple Membership," IDEI Working Papers 715, Institut d'Économie Industrielle (IDEI), Toulouse.
- LE BRETON, Michel & MORENO-TERNERO, Juan D. & SAVVATEEV, Alexei & WEBER, Shlomo, 2010. "Stability and fairness in models with a multiple membership," LIDAM Discussion Papers CORE 2010079, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Michel Le Breton & Juan D. Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2010. "Stability and Fairness in Models with a Multiple Membership," Working Papers 2010-10, Universidad de Málaga, Department of Economic Theory, Málaga Economic Theory Research Center.
- Le Breton, Michel & Moreno-Ternero, Juan D. & Savvateev, Alexei & Weber, Shlomo, 2012. "Stability and Fairness in Models with a Multiple Membership," TSE Working Papers 12-300, Toulouse School of Economics (TSE).
- Ju, Yuan & Chun, Youngsub & van den Brink, René, 2014.
"Auctioning and selling positions: A non-cooperative approach to queueing conflicts,"
Journal of Economic Theory, Elsevier, vol. 153(C), pages 33-45.
- Yuan Ju & Youngsub Chun & Rene van den Brink, 2014. "Auctioning and Selling Positions: a noncooperative approach to queueing conflicts," Working Paper Series no91, Institute of Economic Research, Seoul National University.
- Rene van den Brink & Youngsub Chun & Yuan Ju, 2014. "Auctioning and Selling Positions: A Non-cooperative Approach to Queuing Conflicts," Tinbergen Institute Discussion Papers 14-016/II, Tinbergen Institute.
- Daniel Granot & Jeroen Kuipers & Sunil Chopra, 2002. "Cost Allocation for a Tree Network with Heterogeneous Customers," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 647-661, November.
- Alex Gershkov & Paul Schweinzer, 2010.
"When queueing is better than push and shove,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
- Gerskov, Alex & Schweinzer, Paul, 2006. "When Queueing is Better than Push and Shove," Bonn Econ Discussion Papers 10/2006, University of Bonn, Bonn Graduate School of Economics (BGSE).
- Gershkov, Alex & Schweinzer, Paul, 2006. "When queueing is better than push and shove," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 144, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Debasis Mishra & Bharath Rangarajan, 2007.
"Cost sharing in a job scheduling problem,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
- MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," LIDAM Discussion Papers CORE 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2016.
"Axiomatic characterizations under players nullification,"
Mathematical Social Sciences, Elsevier, vol. 80(C), pages 47-57.
- Sylvain Béal & Sylvain Ferrières & Eric Rémila & Philippe Solal, 2015. "Axiomatic characterizations under players nullification," Working Papers 2015-06, CRESE.
- Sylvain Béal & Eric Rémila & Philippe Solal & Sylvain Ferrières, 2016. "Axiomatic characterizations under players nullification," Working Papers hal-01376911, HAL.
- Sylvain Béal & Sylvain Ferrières & Eric Rémila & Philippe Solal, 2016. "Axiomatic characterizations under players nullification," Post-Print halshs-01293700, HAL.
- Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
- Shoshana Anily & Moshe Haviv, 2010. "Cooperation in Service Systems," Operations Research, INFORMS, vol. 58(3), pages 660-673, June.
- Vijay V. Vazirani, 2022. "New Characterizations of Core Imputations of Matching and $b$-Matching Games," Papers 2202.00619, arXiv.org, revised Dec 2022.
- Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
- repec:ehu:ikerla:34464 is not listed on IDEAS
- Demetrescu, Camil & Lupia, Francesco & Mendicelli, Angelo & Ribichini, Andrea & Scarcello, Francesco & Schaerf, Marco, 2019. "On the Shapley value and its application to the Italian VQR research assessment exercise," Journal of Informetrics, Elsevier, vol. 13(1), pages 87-104.
- Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001.
"Operations research games: A survey,"
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations research games : A survey," Other publications TiSEM 755a430b-592f-400b-ba18-9, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games : A Survey," Other publications TiSEM 04f265e0-8043-4d4f-bf27-2, Tilburg University, School of Economics and Management.
- Borm, P.E.M. & Hamers, H.J.M. & Hendrickx, R.L.P., 2001. "Operations Research Games : A Survey," Discussion Paper 2001-45, Tilburg University, Center for Economic Research.
- Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
More about this item
Keywords
games/group decisions; cooperative; analysis of algorithms; computational complexity; mathematics; combinatorics;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:58:y:2010:i:4-part-2:p:1051-1056. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.