Advanced Search
MyIDEAS: Login

Lower bounds rule!

Contents:

Author Info

  • LUTTENS, Roland Iwan

    ()
    (Ghent University, SHERPPA, B-9000 Ghent, Belgium; Université catholique de Louvain, CORE, B-1348 Louvain-la-Neuve, Belgium)

Registered author(s):

    Abstract

    We propose two axioms that introduce lower bounds into resource monotonicity requirements for rules for the problem of adjudicating conflicting claims. Suppose the amount to divide increases. The first axiom requires that two claimants whose lower bound changes equally experience an equal change in awards. The second axiom requires that extra resources are divided only among those claimants who experience a strictly positive change in their lower bound. We show that, in the two-claimant case, Concede-and-Divide is the only rule that satisfies both axioms when the axioms are defined over a large set of lower bounds that include the minimal rights lower bound and the secured lower bound. We also show that, in the n-claimant case where at least one claimant claims the total amount, the Minimal Overlap rule is the only rule that satisfies both axioms when the axioms are defined over the secured lower bound.

    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://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2010_69web.pdf
    Download Restriction: no

    Bibliographic Info

    Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number 2010069.

    as in new window
    Length:
    Date of creation: 01 Nov 2010
    Date of revision:
    Handle: RePEc:cor:louvco:2010069

    Contact details of provider:
    Postal: Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium)
    Phone: 32(10)474321
    Fax: +32 10474304
    Email:
    Web page: http://www.uclouvain.be/core
    More information through EDIRC

    Related research

    Keywords: claims problems; lower bounds; concede-and-divide; minimal overlap rule;

    Find related papers by JEL classification:

    This paper has been announced in the following NEP Reports:

    References

    References listed on IDEAS
    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.:
    as in new window
    1. Moreno-Ternero, Juan D. & Villar, Antonio, 2004. "The Talmud rule and the securement of agents' awards," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 245-257, March.
    2. Herrero, Carmen & Villar, Antonio, 2001. "The three musketeers: four classical solutions to bankruptcy problems," Mathematical Social Sciences, Elsevier, vol. 42(3), pages 307-328, November.
    3. MORENO-TERNERO, Juan D., . "Composition, securement, and concede-and-divide," CORE Discussion Papers RP -1895, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. Chun, Youngsub & Thomson, William, 2005. "Convergence under replication of rules to adjudicate conflicting claims," Games and Economic Behavior, Elsevier, vol. 50(2), pages 129-142, February.
    5. Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
    6. William Thomson, 2008. "Two families of rules for the adjudication of conflicting claims," Social Choice and Welfare, Springer, vol. 31(4), pages 667-692, December.
    7. Diego Dominguez & William Thomson, 2006. "A new solution to the problem of adjudicating conflicting claims," Economic Theory, Springer, vol. 28(2), pages 283-307, 06.
    8. Belleflamme,Paul & Peitz,Martin, 2010. "Industrial Organization," Cambridge Books, Cambridge University Press, number 9780521681599, November.
    9. Diego Dominguez, 2007. "Lower bounds and recursive methods for the problem of adjudicating conflicting claims," Working Papers 0705, Centro de Investigacion Economica, ITAM.
    10. Winfried Pohlmeier & Luc Bauwens & David Veredas, 2007. "High frequency financial econometrics. Recent developments," ULB Institutional Repository 2013/136223, ULB -- Universite Libre de Bruxelles.
    11. Thomson, William & Yeh, Chun-Hsien, 2008. "Operators for the adjudication of conflicting claims," Journal of Economic Theory, Elsevier, vol. 143(1), pages 177-198, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    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:cor:louvco:2010069. 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: (Alain GILLIS).

    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.