| http://dbpedia.org/ontology/abstract
|
Truthful cake-cutting is the study of algo … Truthful cake-cutting is the study of algorithms for fair cake-cutting that are also truthful mechanisms, i.e., they incentivize the participants to reveal their true valuations to the various parts of the cake. The classic divide and choose procedure for cake-cutting is not truthful: if the cutter knows the chooser's preferences, he can get much more than 1/2 by acting strategically. For example, suppose the cutter values a piece by its size while the chooser values a piece by the amount of chocolate in it. So the cutter can cut the cake into two pieces with almost the same amount of chocolate, such that the smaller piece has slightly more chocolate. Then, the chooser will take the smaller piece and the cutter will win the larger piece, which may be worth much more than 1/2 (depending on how the chocolate is distributed).ding on how the chocolate is distributed).
|
| http://dbpedia.org/ontology/wikiPageID
|
62141894
|
| http://dbpedia.org/ontology/wikiPageLength
|
25696
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1114000727
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Divide_and_choose +
, http://dbpedia.org/resource/Symmetric_fair_cake-cutting +
, http://dbpedia.org/resource/Dubins%E2%80%93Spanier_theorems +
, http://dbpedia.org/resource/Direct_revelation +
, http://dbpedia.org/resource/Exact_division +
, http://dbpedia.org/resource/Pareto_optimal +
, http://dbpedia.org/resource/Piecewise-constant_valuation +
, http://dbpedia.org/resource/Necklace_splitting_problem +
, http://dbpedia.org/resource/Utilitarian_cake-cutting +
, http://dbpedia.org/resource/Category:Mechanism_design +
, http://dbpedia.org/resource/Fair_cake-cutting +
, http://dbpedia.org/resource/Kate_Larson_%28computer_scientist%29 +
, http://dbpedia.org/resource/Strategic_fair_division +
, http://dbpedia.org/resource/Category:Fair_division_protocols +
, http://dbpedia.org/resource/Chore_division +
, http://dbpedia.org/resource/Category:Cake-cutting +
, http://dbpedia.org/resource/Envy-freeness +
, http://dbpedia.org/resource/Truthful_mechanism +
, http://dbpedia.org/resource/Truthful_resource_allocation +
, http://dbpedia.org/resource/Externality +
, http://dbpedia.org/resource/Stromquist%E2%80%93Woodall_theorem +
, http://dbpedia.org/resource/Super-proportional_division +
, http://dbpedia.org/resource/Even%E2%80%93Paz_protocol +
, http://dbpedia.org/resource/Free_disposal +
, http://dbpedia.org/resource/Nash_equilibrium +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:No +
, http://dbpedia.org/resource/Template:Anchor +
, http://dbpedia.org/resource/Template:Some +
, http://dbpedia.org/resource/Template:Yes +
, http://dbpedia.org/resource/Template:Mvar +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Fair_division_protocols +
, http://dbpedia.org/resource/Category:Cake-cutting +
, http://dbpedia.org/resource/Category:Mechanism_design +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Truthful_cake-cutting?oldid=1114000727&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Truthful_cake-cutting +
|
| owl:sameAs |
http://dbpedia.org/resource/Truthful_cake-cutting +
, http://www.wikidata.org/entity/Q85810869 +
, https://global.dbpedia.org/id/Bzswg +
|
| rdfs:comment |
Truthful cake-cutting is the study of algorithms for fair cake-cutting that are also truthful mechanisms, i.e., they incentivize the participants to reveal their true valuations to the various parts of the cake.
|
| rdfs:label |
Truthful cake-cutting
|
