Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    PROPORTIONALITY AND NON-MANIPULABILITY IN BANKRUPTCY PROBLEMS

    We explore the relationship between proportionality and manipulation (via merging or splitting agents' claims) in bankruptcy problems. We provide an alternative proof to the well-known result that, in an unrestricted domain, immunity to manipulation is equivalent to requiring proportional division. We show that this result also holds for restricted (but sufficiently rich) domains, such as the domain of simple problems and the domain of zero-normalized problems. Finally, we characterize two adjustments of the proportional rule by combining non-manipulabilty on these domains and the usual axioms of independence of claims truncation and composition from minimal rights.

  • articleNo Access

    BANKRUPTCY RULES AND COALITIONAL MANIPULATION

    In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents' claims. We focus on the TAL-family of bankruptcy rules (Moreno-Ternero & Villar, 2005), a one-parameter family encompassing three classical rules: the Talmud (T) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-family are partially non-manipulable and identify the domain of problems where each rule is either non-manipulable by merging or non-manipulable by splitting. We also show that they can be ranked in terms of their relative non-manipulability, according to the parameter that generates the family.

  • articleFree Access

    ERRATUM: "BANKRUPTCY RULES AND COALITIONAL MANIPULATION"

    In this paper, we study the immunity of bankruptcy rules to manipulation via merging or splitting agents' claims. We focus on the TAL-family of bankruptcy rules (Moreno-Ternero & Villar, 2006), a one-parameter family encompassing three classical rules: the Talmud (T) rule, the constrained equal-awards (A) rule and the constrained equal-losses (L) rule. We show that all rules within the TAL-family are partially non-manipulable and identify the domain of problems where each rule is either non-manipulable by merging or non-manipulable by splitting. We also show that they can be ranked in terms of their relative non-manipulability, according to the parameter that generates the family.