WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. International Journal of Game Theory
  2. International Journal of Game Theory : Volume 31
  3. International Journal of Game Theory : Volume 31, Issue 3, June 2003
  4. On the serial cost sharing rule
Loading...

Please wait, while we are loading the content...

International Journal of Game Theory : Volume 46
International Journal of Game Theory : Volume 45
International Journal of Game Theory : Volume 44
International Journal of Game Theory : Volume 43
International Journal of Game Theory : Volume 42
International Journal of Game Theory : Volume 41
International Journal of Game Theory : Volume 40
International Journal of Game Theory : Volume 39
International Journal of Game Theory : Volume 38
International Journal of Game Theory : Volume 37
International Journal of Game Theory : Volume 36
International Journal of Game Theory : Volume 35
International Journal of Game Theory : Volume 34
International Journal of Game Theory : Volume 33
International Journal of Game Theory : Volume 32
International Journal of Game Theory : Volume 31
International Journal of Game Theory : Volume 31, Issue 4, September 2003
International Journal of Game Theory : Volume 31, Issue 3, June 2003
Convexity and marginal vectors
Power indices and the veil of ignorance
Allocation processes in cooperative games
Computational complexity of stable partitions with B-preferences
Quitting games – An example
Consistent values and the core in continuum market games with two types of players
The assignment game: the τ-value
Buyer-seller exactness in the assignment game
On the serial cost sharing rule
Neural nets in a group decision process
Additive stable solutions on perfect cones of cooperative games
International Journal of Game Theory : Volume 31, Issue 2, January 2003
International Journal of Game Theory : Volume 31, Issue 1, September 2002
International Journal of Game Theory : Volume 30
International Journal of Game Theory : Volume 29
International Journal of Game Theory : Volume 28
International Journal of Game Theory : Volume 27
International Journal of Game Theory : Volume 26

Similar Documents

...
Decreasing serial cost sharing: an axiomatic characterization

Article

...
Nearly serial sharing methods

Article

...
Marginal cost price rule for homogeneous cost functions

Article

...
Strategy-proofness and public good provision using referenda based on unequal cost sharing

Article

...
Paths and consistency in additive cost sharing

Article

...
The self-dual serial cost-sharing rule

Article

...
Sharing the cost of a network: core and core allocations

Article

...
Merge-proofness in minimum cost spanning tree problems

Article

...
Simple random order methods to share costs

Article

On the serial cost sharing rule

Content Provider Springer Nature Link
Author Albizuri, M. J. Santos, J. C. Zarzuelo, J. M.
Copyright Year 2003
Abstract In this paper we study a solution for discrete cost allocation problems, namely, the serial cost sharing method. We show that this solution can be computed by applying the Shapley value to an appropriate TU game and we present a probabilistic formula. We also define for cost allocation problems a multilinear function in order to obtain the serial cost sharing method as Owen (1972) did for the Shapley value in the cooperative TU context. Moreover we show that the pseudo average cost method is equivalent to an extended Shapley value.
Starting Page 437
Ending Page 446
Page Count 10
File Format PDF
ISSN 00207276
Journal International Journal of Game Theory
Volume Number 31
Issue Number 3
e-ISSN 14321270
Language English
Publisher Springer-Verlag
Publisher Date 2003-06-01
Publisher Place Berlin Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Content Type Text
Resource Type Article
Subject Statistics and Probability Social Sciences Economics and Econometrics Statistics, Probability and Uncertainty
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
Cite this Content
Loading...