Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Robertson–Webb_protocol> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Robertson–Webb_protocol abstract "The Robertson–Webb protocol is a protocol for envy-free cake-cutting which is also near-exact. It has the following properties: It works for any number (n) of partners. It works for any set of weights representing different entitlements of the partners. The pieces are not necessarily connected, i.e. each partner might receive a collection of small "crumbs". The number of queries is finite but unbounded – it is not known in advance how many queries will be needed.The protocol was developed by Jack M. Robertson and William A. Webb. It was first published in 1997 and later in 1998.".
- Robertson–Webb_protocol wikiPageID "44508172".
- Robertson–Webb_protocol wikiPageLength "6223".
- Robertson–Webb_protocol wikiPageOutDegree "8".
- Robertson–Webb_protocol wikiPageRevisionID "679709450".
- Robertson–Webb_protocol wikiPageWikiLink Brams–Taylor_procedure.
- Robertson–Webb_protocol wikiPageWikiLink Brams–Taylor_protocol.
- Robertson–Webb_protocol wikiPageWikiLink Category:Fair_division_protocols.
- Robertson–Webb_protocol wikiPageWikiLink Envy-free_cake-cutting.
- Robertson–Webb_protocol wikiPageWikiLink Exact_division.
- Robertson–Webb_protocol wikiPageWikiLink Jack_Robertson_(mathematician).
- Robertson–Webb_protocol wikiPageWikiLink Near-exact.
- Robertson–Webb_protocol wikiPageWikiLink Near-exact_division_procedure.
- Robertson–Webb_protocol wikiPageWikiLink Simmons–Su_protocols.
- Robertson–Webb_protocol wikiPageWikiLink William_A._Webb.
- Robertson–Webb_protocol wikiPageWikiLinkText "Robertson and Webb (1998)".
- Robertson–Webb_protocol wikiPageWikiLinkText "Robertson-Webb".
- Robertson–Webb_protocol wikiPageWikiLinkText "Robertson–Webb protocol".
- Robertson–Webb_protocol hasPhotoCollection Robertson–Webb_protocol.
- Robertson–Webb_protocol wikiPageUsesTemplate Template:Dn.
- Robertson–Webb_protocol wikiPageUsesTemplate Template:Reflist.
- Robertson–Webb_protocol wikiPageUsesTemplate Template:Technical.
- Robertson–Webb_protocol subject Category:Fair_division_protocols.
- Robertson–Webb_protocol comment "The Robertson–Webb protocol is a protocol for envy-free cake-cutting which is also near-exact. It has the following properties: It works for any number (n) of partners. It works for any set of weights representing different entitlements of the partners. The pieces are not necessarily connected, i.e. each partner might receive a collection of small "crumbs".".
- Robertson–Webb_protocol label "Robertson–Webb protocol".
- Robertson–Webb_protocol sameAs m.012c64wn.
- Robertson–Webb_protocol wasDerivedFrom Robertson–Webb_protocol?oldid=679709450.
- Robertson–Webb_protocol isPrimaryTopicOf Robertson–Webb_protocol.