This HTML5 document contains 43 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/
n14https://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/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:House_allocation_problem
rdfs:label
House allocation problem
rdfs:comment
In economics and computer science, the house allocation problem is the problem of assigning objects to people with different preferences, such that each person receives exactly one object. The name "house allocation" comes from the main motivating application, which is assigning dormitory houses to students. Other commonly used terms are assignment problem and one-sided matching. When agents already own houses (and may trade them with other agents), the problem is often called a housing market. In house allocation problems, it is assumed that monetary transfers are not allowed; the variant in which monetary transfers are allowed is known as rental harmony.
dcterms:subject
dbc:Fair_item_allocation dbc:Matching_(graph_theory)
dbo:wikiPageID
68078439
dbo:wikiPageRevisionID
1076950671
dbo:wikiPageWikiLink
dbr:Social_network dbr:Serial_dictatorship dbr:Envy-free_matching dbr:Fair_random_assignment dbr:Bipartite_graph dbr:Core-stable dbr:Top_trading_cycle dbr:Strategyproofness dbr:Preference_(economics) dbr:Fair_item_allocation dbr:Random_priority_item_allocation dbr:Exact_cover dbr:Hall_violator dbr:Rental_harmony dbr:Computer_science dbr:Tayfun_Sönmez dbr:Pareto_efficiency dbr:Assignment_problem dbr:Economics dbr:Maximum_cardinality_matching dbc:Fair_item_allocation dbr:Weighted_graph dbr:Equitable_division dbr:Envy-freeness dbc:Matching_(graph_theory) dbr:Small_set_expansion_hypothesis dbr:Fair_division dbr:Proportional_division dbr:Cardinal_utility
owl:sameAs
wikidata:Q107525309 n14:Fswdw
dbp:wikiPageUsesTemplate
dbt:Rp dbt:Reflist
dbo:abstract
In economics and computer science, the house allocation problem is the problem of assigning objects to people with different preferences, such that each person receives exactly one object. The name "house allocation" comes from the main motivating application, which is assigning dormitory houses to students. Other commonly used terms are assignment problem and one-sided matching. When agents already own houses (and may trade them with other agents), the problem is often called a housing market. In house allocation problems, it is assumed that monetary transfers are not allowed; the variant in which monetary transfers are allowed is known as rental harmony.
prov:wasDerivedFrom
wikipedia-en:House_allocation_problem?oldid=1076950671&ns=0
dbo:wikiPageLength
11611
foaf:isPrimaryTopicOf
wikipedia-en:House_allocation_problem