2006, English, Article edition: Fair cost-sharing methods for the minimum spanning tree game Angel, Eric; Bampis, Evripidis; Blin, Lélia; ...

User activity

Share to:
 
Bookmark: http://trove.nla.gov.au/version/209513
Physical Description
  • text
Published
  • HAL - CCSD
  • 2006
Language
  • English

Edition details

Title
  • Fair cost-sharing methods for the minimum spanning tree game
Author
  • Angel, Eric
  • Bampis, Evripidis
  • Blin, Lélia
  • Gourvès, Laurent
Published
  • HAL - CCSD
  • 2006
Physical Description
  • text
Subjects
Notes
  • We study the problem of sharing in a fair manner the cost of a service provided to a set of players in the context of Cooperative Game Theory. We introduice a new fairness measure capturing the dissatisfaction (or happiness) of each player and we propose two cost sharing methods minimizing the maximum or average dissatisfaction of the clients for the classical minimum spannig tree game.
  • HAL:hal-00341341, version 1
  • HAL:http:/​/​hal.archives-ouvertes.fr/​hal-00341341/​en/​
  • DOI:10.1016/​j.ipl.2006.05.007
Language
  • English
Contributed by
OAIster

Get this edition

  • Set up My libraries

    How do I set up "My libraries"?

    In order to set up a list of libraries that you have access to, you must first login or sign up. Then set up a personal list of libraries from your profile page by clicking on your user name at the top right of any screen.

  • All (1)
  • Unknown (1)
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.
None of your libraries hold this item.

User activity


e.g. test cricket, Perth (WA), "Parkes, Henry"

Separate different tags with a comma. To include a comma in your tag, surround the tag with double quotes.

Be the first to add a tag for this edition

Be the first to add this to a list

Comments and reviews

What are comments? Add a comment

No user comments or reviews for this version

Add a comment