This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Characterizations of solutions in digraph competitions

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Quant, M.
Borm, P.
Reijnierse, H.
Voorneveld, M. (Tilburg University, Center for Economic Research)

Additional information is available for the following registered author(s):

Abstract

The ? -measure is introduces as a method to rank the nodes in a digraph competition. It coincides with the ? -value of an associated transferable utility game, the so-called digraph game. The ? -measure is characterized in two ways. One of them is based on a characterization of the ? -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
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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
File Format: application/pdf
File Function:
Download Restriction: no

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

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: 2002
Date of revision:
Handle: RePEc:dgr:kubcen:2002113

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

For technical questions regarding this item, or to correct its listing, contact: (Corry Stuyts).

Related research
Keywords:

Find related papers by JEL classification:
C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

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.:

  1. Borm, P. & Brink, R. van den & Slikker, M., 2000. "An iterative procedure for evaluating digraph competitions," Research Memorandum 788, Tilburg University, Faculty of Economics and Business Administration. [Downloadable!]
  2. René van den Brink & Peter Borm, 2002. "Digraph Competitions and Cooperative Games," Theory and Decision, Springer, vol. 53(4), pages 327-342, December. [Downloadable!] (restricted)
  3. Borm, Peter & van den Brink, Rene & Levinsky, Rene & Slikker, Marco, 2004. "On two new social choice correspondences," Mathematical Social Sciences, Elsevier, vol. 47(1), pages 51-68, January. [Downloadable!] (restricted)
    Other versions:
Full references

Cited by:
(explanations, 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.)

  1. Reijnierse, H. & Borm, P. & Quant, M. & Voorneveld, M., 2003. "On a compromise social choice correspondence," Discussion Paper 29, Tilburg University, Center for Economic Research. [Downloadable!]
    Other versions:
Statistics
Access and download statistics

Did you know? IDEAS also covers the most complete directory of Economics departments and institutes, EDIRC.

This page was last updated on 2009-11-25.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.