HTML Microdata document

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

Prefix	IRI
dcterms	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n10	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Statements

Subject Item: dbr:Eval_query
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model
dbo:wikiPageRedirects: dbr:Robertson–Webb_query_model

Subject Item: dbr:Proportional_cake-cutting
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Proportional_cake-cutting_with_different_entitlements
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Robertson–Webb_envy-free_cake-cutting_algorithm
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Robertson–Webb_query_model
rdfs:label: Robertson–Webb query model
rdfs:comment: In computer science, the Robertson–Webb (RW) query model is a model of computation used by algorithms for the problem of fair cake-cutting. In this problem, there is a resource called a "cake", and several agents with different value measures on the cake. The goal is to divide the cake among the agents such that each agent will consider his/her piece as "fair" by his/her personal value measure. Since the agents' valuations can be very complex, they cannot - in general - be given as inputs to a fair division algorithm. The RW model specifies two kinds of queries that a fair division algorithm may ask the agents: Eval and Cut. Informally, an Eval query asks an agent to specify his/her value to a given piece of the cake, and a Cut query (also called a Mark query) asks an agent to specify a pi
dcterms:subject: dbc:Models_of_computation dbc:Cake-cutting
dbo:wikiPageID: 66797876
dbo:wikiPageRevisionID: 1085328406
dbo:wikiPageWikiLink: dbr:Envy-free_cake-cutting dbr:Moving-knife_procedure dbr:Last_diminisher dbr:Jack_Robertson_(mathematician) dbr:Truthful_cake-cutting dbr:Demand_oracle dbr:Divide_and_choose dbr:Computer_science dbr:Even–Paz_protocol dbr:William_Albert_Webb dbc:Models_of_computation dbr:Fair_cake-cutting dbr:Maximin_share dbr:Exact_cake-cutting dbr:Fair_pie-cutting dbr:Model_of_computation dbc:Cake-cutting dbr:Proportional_cake-cutting dbr:Proportional_cake-cutting_with_different_entitlements dbr:Equitable_cake-cutting
owl:sameAs: n10:Frd4U wikidata:Q105753421
dbp:wikiPageUsesTemplate: dbt:Reflist
dbo:abstract: In computer science, the Robertson–Webb (RW) query model is a model of computation used by algorithms for the problem of fair cake-cutting. In this problem, there is a resource called a "cake", and several agents with different value measures on the cake. The goal is to divide the cake among the agents such that each agent will consider his/her piece as "fair" by his/her personal value measure. Since the agents' valuations can be very complex, they cannot - in general - be given as inputs to a fair division algorithm. The RW model specifies two kinds of queries that a fair division algorithm may ask the agents: Eval and Cut. Informally, an Eval query asks an agent to specify his/her value to a given piece of the cake, and a Cut query (also called a Mark query) asks an agent to specify a piece of cake with a given value. Despite the simplicity of the model, many classic cake-cutting algorithms can be described only by these two queries. On the other hand, there are fair cake-cutting problems that provably cannot be solved in the RW model using finitely many queries. The Eval and Cut queries were first described in the book of and . The name "Robertson–Webb model" was coined and formalized by Woeginger and Sgall.
prov:wasDerivedFrom: wikipedia-en:Robertson–Webb_query_model?oldid=1085328406&ns=0
dbo:wikiPageLength: 14919
foaf:isPrimaryTopicOf: wikipedia-en:Robertson–Webb_query_model

Subject Item: dbr:Envy-free_cake-cutting
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Equitable_cake-cutting
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Demand_oracle
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Fair_cake-cutting
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Fair_division_among_groups
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Model_of_computation
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Exact_division
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model

Subject Item: dbr:Robertson-Webb_query_model
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model
dbo:wikiPageRedirects: dbr:Robertson–Webb_query_model

Subject Item: dbr:Mark_query
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model
dbo:wikiPageRedirects: dbr:Robertson–Webb_query_model

Subject Item: dbr:Cut_query
dbo:wikiPageWikiLink: dbr:Robertson–Webb_query_model
dbo:wikiPageRedirects: dbr:Robertson–Webb_query_model

Subject Item: wikipedia-en:Robertson–Webb_query_model
foaf:primaryTopic: dbr:Robertson–Webb_query_model