About: Surplus sharing     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSurplus_sharing&invfp=IFP_OFF&sas=SAME_AS_OFF

Surplus sharing is a kind of a fair division problem where the goal is to share the financial benefits of cooperation (the "economic surplus") among the cooperating agents. As an example, suppose there are several workers such that each worker i, when working alone, can gain some amount ui. When they all cooperate in a joint venture, the total gain is u1+...+un+s, where s>0. This s is called the surplus of cooperation, and the question is: what is a fair way to divide s among the n agents? When the only available information is the ui, there are two main solutions:

AttributesValues
rdfs:label
  • Surplus sharing (en)
rdfs:comment
  • Surplus sharing is a kind of a fair division problem where the goal is to share the financial benefits of cooperation (the "economic surplus") among the cooperating agents. As an example, suppose there are several workers such that each worker i, when working alone, can gain some amount ui. When they all cooperate in a joint venture, the total gain is u1+...+un+s, where s>0. This s is called the surplus of cooperation, and the question is: what is a fair way to divide s among the n agents? When the only available information is the ui, there are two main solutions: (en)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Surplus sharing is a kind of a fair division problem where the goal is to share the financial benefits of cooperation (the "economic surplus") among the cooperating agents. As an example, suppose there are several workers such that each worker i, when working alone, can gain some amount ui. When they all cooperate in a joint venture, the total gain is u1+...+un+s, where s>0. This s is called the surplus of cooperation, and the question is: what is a fair way to divide s among the n agents? When the only available information is the ui, there are two main solutions: * Equal sharing: each agent i gets ui+s/n, that is, each agent gets an equal share of the surplus. * Proportional sharing: each agent i gets ui+(s*ui/Σui), that is, each agent gets a share of the surplus proportional to his external value (similar to the proportional rule in bankruptcy). In other words, ui is considered a measure of the agent's contribution to the joint venture. Kolm calls the equal sharing "leftist" and the proportional sharing "rightist". Chun presents a characterization of the proportional rule. Moulin presents a characterization of the equal and proportional rule together by four axioms (in fact, any three of these axioms are sufficient): 1. * Separability - the division of surplus within any coalition T should depend only on the total amount allocated to T, and on the opportunity costs of agents within T. 2. * No advantageous reallocation - no coalition can benefit from redistributing its ui among its members (this is a kind of strategyproofness axiom). 3. * Additivity - for each agent i, the allocation to i is a linear function of the total surplus s. 4. * Path independence - for each agent i, the allocation to i from surplus s is the same as allocating a part of s, updating the ui, and then allocating the remaining part of s. Any pair of these axioms characterizes a different family of rules, which can be viewed as a compromise between equal and proportional sharing. When there is information about the possible gains of sub-coalitions (e.g., it is known how much agents 1,2 can gain when they collaborate in separation from the other agents), other solutions become available, for example, the Shapley value. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software