This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n12https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Efficient_approximately-fair_item_allocation
rdfs:label
Efficient approximately-fair item allocation
rdfs:comment
When allocating objects among people with different preferences, two major goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single house and two people, every allocation of the house will be unfair to one person. Therefore, several common approximations have been studied, such as maximin-share fairness (MMS), envy-freeness up to one item (EF1), proportionality up to one item (PROP1), and equitability up to one item (EQ1). The problem of efficient approximately-fair item allocation is to find an allocation that is both Pareto-efficient (PE) and satisfies one of these fairness notions. The problem was first presented at 2016 and has attracted considerable attention since then.
dcterms:subject
dbc:Fair_item_allocation
dbo:wikiPageID
63233978
dbo:wikiPageRevisionID
1102260109
dbo:wikiPageWikiLink
dbr:Envy-graph_procedure dbr:Efficient_envy-free_division dbr:Submodular_set_function dbr:Integer_linear_program dbr:First_Welfare_Theorem dbr:Strongly_NP-hard dbr:Truthful_mechanism dbr:Tree-depth dbr:Round-robin_item_allocation dbr:Fisher_market dbr:Integer_programming dbr:Equitable_division dbr:Rental_harmony dbr:Proportional_item_allocation dbr:Lorenz_dominant dbr:Adjusted_winner_procedure dbr:Competitive_equilibrium dbr:Fractionally_Pareto_optimal dbr:A-CEEI_mechanism dbr:APX-hard dbr:Proportional_division dbr:NP-hard dbr:Pareto-efficient dbr:Submodular dbr:Additive_utilities dbc:Fair_item_allocation dbr:Envy-free dbr:Rolf_Niedermeier dbr:Budget-additive_valuation dbr:Maximin-share dbr:Fractional_Pareto_efficiency dbr:Pseudo-polynomial_time dbr:Pareto_efficiency dbr:Group_strategyproof dbr:Basis_of_a_matroid dbr:Envy-free_item_allocation dbr:Decreasing_marginal_return dbr:Envy-freeness
owl:sameAs
n12:C5Fw4 wikidata:Q96377035
dbp:wikiPageUsesTemplate
dbt:Sic dbt:Rp dbt:Reflist
dbo:abstract
When allocating objects among people with different preferences, two major goals are Pareto efficiency and fairness. Since the objects are indivisible, there may not exist any fair allocation. For example, when there is a single house and two people, every allocation of the house will be unfair to one person. Therefore, several common approximations have been studied, such as maximin-share fairness (MMS), envy-freeness up to one item (EF1), proportionality up to one item (PROP1), and equitability up to one item (EQ1). The problem of efficient approximately-fair item allocation is to find an allocation that is both Pareto-efficient (PE) and satisfies one of these fairness notions. The problem was first presented at 2016 and has attracted considerable attention since then.
prov:wasDerivedFrom
wikipedia-en:Efficient_approximately-fair_item_allocation?oldid=1102260109&ns=0
dbo:wikiPageLength
38282
foaf:isPrimaryTopicOf
wikipedia-en:Efficient_approximately-fair_item_allocation