Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Flow Approach to Bankruptcy Problems

Contents:

Author Info

  • Rodica Branzei

    ()
    (Alexandru Ioan Cuza University, Faculty of Computer Science, Iasi, Romania)

  • Giulio Ferrari

    ()
    (University of Genoa, Department of Mathematics, Genoa, Italy)

  • Vito Fragnelli

    ()
    (University of Eastern Piedmont, Department of Advanced Sciences and Technologies, Alessandria, Italy)

  • Stef Tijs

    ()
    (Center and Department of Econometrics and Operations Research, University of Tilburg, Tilburg, Netherlands)

Abstract

In this note we represent a classical bankruptcy problem as a standard flow problem on a simple network and implement some known division rules from the bankruptcy literature via suitable cost functions in the related minimum cost flow problem.

Download Info

If 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.
File URL: http://auco.fsv.cuni.cz/storage/39_2008_01_146.pdf
Download Restriction: no

Bibliographic Info

Article provided by Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies in its journal AUCO Czech Economic Review.

Volume (Year): 2 (2008)
Issue (Month): 2 (September)
Pages: 146-153

as in new window
Handle: RePEc:fau:aucocz:au2008_146

Contact details of provider:
Postal: Opletalova 26, CZ-110 00 Prague
Phone: +420 2 222112330
Fax: +420 2 22112304
Email:
Web page: http://ies.fsv.cuni.cz/
More information through EDIRC

Order Information:
Email:
Web: http://auco.cuni.cz/

Related research

Keywords: Allocation rules; bankruptcy problems; flow problems;

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Erik Ansink & Hans-Peter Weikard, 2012. "Sequential sharing rules for river sharing problems," Social Choice and Welfare, Springer, vol. 38(2), pages 187-210, February.
  2. William Thomson, 2013. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: an update," RCER Working Papers 578, University of Rochester - Center for Economic Research (RCER).
  3. Rahmi Ilkilic, 2012. "Allocation rules on networks," DOCUMENTOS DE TRABAJO 009380, UNIVERSIDAD DEL ROSARIO.
  4. Beard, Rodney, 2011. "The river sharing problem: A review of the technical literature for policy economists," MPRA Paper 34382, University Library of Munich, Germany.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:fau:aucocz:au2008_146. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lenka Stastna).

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.