Advanced Search
MyIDEAS: Login

Obligation Rules

Contents:

Author Info

  • Gustavo Bergantiños
  • Anirban Kar

    ()

Abstract

They provide a characterization of the obligation rules in the context of minimum cost spanning tree games. They also explore the relation between obligation rules and random order values of their reducible cost game - it is shown that the later is a subset of the obligation rules. Moreover we provide a necessary and sufficient condition on obligation function such that the corresponding obligation rule coincides with a random order value.

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.esocialsciences.org/Download/repecDownload.aspx?fname=Document111102010400.5560114.pdf&fcategory=Articles&AId=3009&fref=repec
Our checks indicate that this address may not be valid because: 403 Forbidden. If this is indeed the case, please notify (Padma Prakash)
Download Restriction: no

Bibliographic Info

Paper provided by eSocialSciences in its series Working Papers with number id:3009.

as in new window
Length:
Date of creation: Oct 2010
Date of revision:
Handle: RePEc:ess:wpaper:id:3009

Note: Institutional Papers
Contact details of provider:
Web page: http://www.esocialsciences.org

Related research

Keywords: characterization; obligation; cost spanning; sufficient; coincides;

Other versions of this item:

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. Brânzei, R. & Moretti, S. & Norde, H.W. & Tijs, S.H., 2003. "The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations," Discussion Paper 2003-129, Tilburg University, Center for Economic Research.
  2. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
  3. Stefano Moretti & Rodica Branzei & Henk Norde & Stef Tijs, 2004. "The P-value for cost sharing in minimum," Theory and Decision, Springer, vol. 56(1), pages 47-61, 04.
  4. Norde, H.W. & Moretti, S. & Tijs, S.H., 2001. "Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes," Discussion Paper 2001-18, Tilburg University, Center for Economic Research.
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:ess:wpaper:id:3009. 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: (Padma Prakash).

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.