Balanced Consistency and Balanced Cost Reduction for Sequencing Problems
AbstractWe investigate the implications of imposing balanced consistency and balanced cost reduction in the context of sequencing problems. Balanced consistency requires that the effect on the payoff from the departure of one agent to another agent should be equal between any two agents. On the other hand, balanced cost reduction requires that if one agent leaves a problem, then the total payoffs of the remaining agents should be affected by the amount previously assigned to the leaving agent. We show that the minimal transfer rule is the only rule satisfying efficiency and Pareto indifference together with either one of our two main axioms, balanced consistency and balanced cost reduction.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Tinbergen Institute in its series Tinbergen Institute Discussion Papers with number 10-035/1.
Date of creation: 19 Mar 2010
Date of revision:
Contact details of provider:
Web page: http://www.tinbergen.nl
Sequencing problem; minimal transfer rule; balanced consistency; balanced cost reduction;
Other versions of this item:
- René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer, vol. 38(3), pages 519-529, March.
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
This paper has been announced in the following NEP Reports:
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Thomson, William, 1983. "Problems of fair division and the Egalitarian solution," Journal of Economic Theory, Elsevier, vol. 31(2), pages 211-226, December.
- Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
- Jeroen Suijs, 1996. "On incentive compatibility and budget balancedness in public decision making," Review of Economic Design, Springer, vol. 2(1), pages 193-209, December.
- Maniquet, F., 2000.
"A Characterization of the Shapley Value in Queueing Problems,"
222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
- 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, François, . "A characterization of the Shapley value in queueing problems," CORE Discussion Papers RP -1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Manipushpak Mitra, 2000.
"Mechanism Design in Queueing Problems,"
Econometric Society World Congress 2000 Contributed Papers
1301, Econometric Society.
- van den Brink, Rene, 2007. "Null or nullifying players: The difference between the Shapley value and equal division solutions," Journal of Economic Theory, Elsevier, vol. 136(1), pages 767-775, September.
- Manipushpak Mitra, 2002.
"Achieving the first best in sequencing problems,"
Review of Economic Design,
Springer, vol. 7(1), pages 75-91.
- Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154243, Tilburg University.
- Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer, vol. 29(1), pages 151-162, September.
- MISHRA, Debasis & RANGARAJAN, Bharath, 2005.
"Cost sharing in a job scheduling problem,"
CORE Discussion Papers
2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, vol. 33(2), pages 349-364, November.
- Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer, vol. 40(1), pages 29-41, February.
- Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
- Brink, J.R. van den, 1999.
"An Axiomatization of the Shapley Value Using a Fairness Property,"
1999-120, Tilburg University, Center for Economic Research.
- René van den Brink, 2002. "An axiomatization of the Shapley value using a fairness property," International Journal of Game Theory, Springer, vol. 30(3), pages 309-319.
- Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Antoine Maartens (+31 626 - 160 892)).
If references are entirely missing, you can add them using this form.