Cost sharing in a job scheduling problem
Author
Abstract
(This abstract was borrowed from another version of this item.)
Suggested Citation
DOI: 10.1007/s00355-006-0210-3
Download full text from publisher
As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.
Other versions of this item:
- 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).
References listed on IDEAS
- Moulin, Herve, 2002.
"Axiomatic cost and surplus sharing,"
Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357,
Elsevier.
- Moulin, Herve, 2001. "Axiomatic Cost and Surplis-Sharing," Working Papers 2001-06, Rice University, Department of Economics.
- Hamers, Herbert & Suijs, Jeroen & Tijs, Stef & Borm, Peter, 1996.
"The Split Core for Sequencing Games,"
Games and Economic Behavior, Elsevier, vol. 15(2), pages 165-176, August.
- Hamers, H.J.M. & Suijs, J.P.M. & Tijs, S.H. & Borm, P.E.M., 1994. "The split core for sequencing games," Other publications TiSEM eb93d672-0769-40c4-9445-5, Tilburg University, School of Economics and Management.
- Hamers, H.J.M. & Suijs, J.P.M. & Tijs, S.H. & Borm, P.E.M., 1996. "The split core of sequencing games," Other publications TiSEM 28693e2d-82da-456a-909b-3, Tilburg University, School of Economics and Management.
- 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).
- Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
- Manipushpak Mitra, 2002.
"Achieving the first best in sequencing problems,"
Review of Economic Design, Springer;Society for Economic Design, vol. 7(1), pages 75-91.
- Mitra, Manipushpak, 2000. "Achieving the First Best in Sequencing Problems," Bonn Econ Discussion Papers 11/2001, University of Bonn, Bonn Graduate School of Economics (BGSE).
- Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 29-41, February.
- Flip Klijn & Estela Sánchez, 2006.
"Sequencing games without initial order,"
Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 53-62, February.
- Flip Klijn & Estela S?chez, 2004. "Sequencing Games without Initial Order," UFAE and IAE Working Papers 622.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- 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).
- Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 151-162, September.
- Moulin, Herve, 1992. "An Application of the Shapley Value to Fair Division with Money," Econometrica, Econometric Society, vol. 60(6), pages 1331-1349, November.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- 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.
- Cheng‐Kuang Wu & Yi‐Ming Chen & Dachrahn Wu & Ching‐Lin Chi, 2020. "A Game Theory Approach for Assessment of Risk and Deployment of Police Patrols in Response to Criminal Activity in San Francisco," Risk Analysis, John Wiley & Sons, vol. 40(3), pages 534-549, March.
- Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
- 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.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
- 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).
- Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
- 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.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
- Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
- Ragavendran Gopalakrishnan & Jason R. Marden & Adam Wierman, 2014. "Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 1252-1296, November.
- Andreas S. Schulz & Nelson A. Uhan, 2010. "Sharing Supermodular Costs," Operations Research, INFORMS, vol. 58(4-part-2), pages 1051-1056, August.
- 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.
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.- 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.
- Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
- Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
- Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
- 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.
- 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.
- 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.
- Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
- De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
- Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017.
"Reordering an existing queue,"
Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
- Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Division of Economics, School of Business, University of Leicester.
- Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
- Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 29-41, February.
- Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
- van Velzen, S. & Hamers, H.J.M., 2002. "On the Balancedness of Relaxed Sequencing Games," Discussion Paper 2002-49, Tilburg University, Center for Economic Research.
- Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010.
"Processing games with restricted capacities,"
European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
- Meertens, M. & Borm, P.E.M. & Reijnierse, J.H. & Quant, M., 2004. "Processing Games with Restricted Capacities," Other publications TiSEM a769e434-b8c9-4116-8897-f, Tilburg University, School of Economics and Management.
- Meertens, M. & Borm, P.E.M. & Reijnierse, J.H. & Quant, M., 2004. "Processing Games with Restricted Capacities," Discussion Paper 2004-83, Tilburg University, Center for Economic Research.
- René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 693-714, March.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2015.
"Step out–Step in sequencing games,"
European Journal of Operational Research, Elsevier, vol. 246(3), pages 894-906.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2014. "Step out - Step in Sequencing Games," Discussion Paper 2014-070, Tilburg University, Center for Economic Research.
- Musegaas, M. & Borm, P.E.M. & Quant, M., 2014. "Step out - Step in Sequencing Games," Other publications TiSEM 68089383-0b91-4cc8-9d03-e, Tilburg University, School of Economics and Management.
- Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013.
"Family sequencing and cooperation,"
European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
- Grundel, S. & Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M., 2012. "Family Sequencing and Cooperation," Other publications TiSEM 830f760f-f003-40df-a01c-6, Tilburg University, School of Economics and Management.
- Grundel, S. & Ciftci, B.B. & Borm, P.E.M. & Hamers, H.J.M., 2012. "Family Sequencing and Cooperation," Discussion Paper 2012-040, Tilburg University, Center for Economic Research.
- 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.
- Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
More about this item
JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- C62 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Existence and Stability Conditions of Equilibrium
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
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:spr:sochwe:v:29:y:2007:i:3:p:369-382. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.