| http://dbpedia.org/ontology/abstract
|
In economics and computer science, Fractio … In economics and computer science, Fractional Pareto efficiency or Fractional Pareto optimality (fPO) is a variant of Pareto efficiency used in the setting of fair allocation of discrete objects. An allocation of objects is called discrete if each item is wholly allocated to a single agent; it is called fractional if some objects are split among two or more agents. A discrete allocation is called Pareto-efficient (PO) if it is not Pareto-dominated by any discrete allocation; it is called fractionally Pareto-efficient (fPO) if it is not Pareto-dominated by any discrete or fractional allocation. So fPO is a stronger requirement than PO: every fPO allocation is PO, but not every PO allocation is fPO.is PO, but not every PO allocation is fPO.
|
| http://dbpedia.org/ontology/wikiPageID
|
67056752
|
| http://dbpedia.org/ontology/wikiPageLength
|
23517
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1110269415
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Bellman%E2%80%93Ford_algorithm +
, http://dbpedia.org/resource/Fair_item_allocation +
, http://dbpedia.org/resource/Bipartite_graph +
, http://dbpedia.org/resource/Takashi_Negishi +
, http://dbpedia.org/resource/Hal_Varian +
, http://dbpedia.org/resource/First_Welfare_Theorem +
, http://dbpedia.org/resource/CoNP-complete +
, http://dbpedia.org/resource/Sperner%27s_lemma +
, http://dbpedia.org/resource/Linear_program +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Serial_dictatorship +
, http://dbpedia.org/resource/Basic_feasible_solution +
, http://dbpedia.org/resource/Linear_programming +
, http://dbpedia.org/resource/Economics +
, http://dbpedia.org/resource/Envy-free_item_allocation +
, http://dbpedia.org/resource/Pareto_efficiency +
, http://dbpedia.org/resource/Simplex_algorithm +
, http://dbpedia.org/resource/Fisher_market +
, http://dbpedia.org/resource/Category:Pareto_efficiency +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Rp +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Pareto_efficiency +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Fractional_Pareto_efficiency?oldid=1110269415&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Fractional_Pareto_efficiency +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q111954636 +
, https://global.dbpedia.org/id/GTbEH +
, http://dbpedia.org/resource/Fractional_Pareto_efficiency +
|
| rdfs:comment |
In economics and computer science, Fractio … In economics and computer science, Fractional Pareto efficiency or Fractional Pareto optimality (fPO) is a variant of Pareto efficiency used in the setting of fair allocation of discrete objects. An allocation of objects is called discrete if each item is wholly allocated to a single agent; it is called fractional if some objects are split among two or more agents. A discrete allocation is called Pareto-efficient (PO) if it is not Pareto-dominated by any discrete allocation; it is called fractionally Pareto-efficient (fPO) if it is not Pareto-dominated by any discrete or fractional allocation. So fPO is a stronger requirement than PO: every fPO allocation is PO, but not every PO allocation is fPO.is PO, but not every PO allocation is fPO.
|
| rdfs:label |
Fractional Pareto efficiency
|
