Advanced Search
MyIDEAS: Login

Characterizations of Solutions in Digraph Competitions

Contents:

Author Info

  • Quant, M.
  • Borm, P.E.M.
  • Reijnierse, J.H.
  • Voorneveld, M.

    (Tilburg University, Center for Economic Research)

Abstract

The T -measure is introduces as a method to rank the nodes in a digraph competition.It coincides with the T -value of an associated transferable utility game, the so-called digraph game.The T -measure is characterized in two ways.One of them is based on a characterization of the T -value in bankruptcy games and uses a decomposition axiom.This characterization also leads to a new characterization of the --measure, a solution method for digraph competitions based on the Shapley value of the digraph game.

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://arno.uvt.nl/show.cgi?fid=4412
Our checks indicate that this address may not be valid because: 404 Not Found. If this is indeed the case, please notify (Richard Broekman)
Download Restriction: no

Bibliographic Info

Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 2002-113.

as in new window
Length:
Date of creation: 2002
Date of revision:
Handle: RePEc:dgr:kubcen:2002113

Contact details of provider:
Web page: http://center.uvt.nl

Related research

Keywords: T-value; digraph competition; cooperative games;

Find related papers by JEL classification:

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. Borm, P.E.M. & Brink, J.R. van den & Levinsky, R. & Slikker, M., 2000. "On Two New Social Choice Correspondences," Discussion Paper 2000-125, Tilburg University, Center for Economic Research.
  2. René van den Brink & Peter Borm, 2002. "Digraph Competitions and Cooperative Games," Theory and Decision, Springer, vol. 53(4), pages 327-342, December.
  3. Borm, P.E.M. & Brink, J.R. van den & Slikker, M., 2002. "An iterative procedure for evaluating digraph competitions," Open Access publications from Tilburg University urn:nbn:nl:ui:12-90188, Tilburg University.
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:dgr:kubcen:2002113. 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: (Richard Broekman).

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.