This HTML5 document contains 19 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/
n8https://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/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
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:Consensus_estimate
rdfs:label
Consensus estimate
rdfs:comment
Consensus estimate is a technique for designing truthful mechanisms in a prior-free mechanism design setting. The technique was introduced for digital goods auctions and later extended to more general settings. Suppose there is a digital good that we want to sell to a group of buyers with unknown valuations. We want to determine the price that will bring us maximum profit. Suppose we have a function that, given the valuations of the buyers, tells us the maximum profit that we can make. We can use it in the following way: Such random variable is called a consensus estimate:
dcterms:subject
dbc:Mechanism_design
dbo:wikiPageID
49697215
dbo:wikiPageRevisionID
1000096059
dbo:wikiPageWikiLink
dbr:Truthful_mechanism dbr:Random-sampling_mechanism dbc:Mechanism_design dbr:Digital_goods_auction dbr:Prior-free_mechanism_design dbr:Profit_extraction_mechanism
owl:sameAs
n8:2Nhad wikidata:Q25304898
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Rp
dbo:abstract
Consensus estimate is a technique for designing truthful mechanisms in a prior-free mechanism design setting. The technique was introduced for digital goods auctions and later extended to more general settings. Suppose there is a digital good that we want to sell to a group of buyers with unknown valuations. We want to determine the price that will bring us maximum profit. Suppose we have a function that, given the valuations of the buyers, tells us the maximum profit that we can make. We can use it in the following way: 1. * Ask the buyers to tell their valuations. 2. * Calculate - the maximum profit possible given the valuations. 3. * Calculate a price that guarantees that we get a profit of . Step 3 can be attained by a profit extraction mechanism, which is a truthful mechanism. However, in general the mechanism is not truthful, since the buyers can try to influence by bidding strategically. To solve this problem, we can replace the exact with an approximation - - that, with high probability, cannot be influenced by a single agent. As an example, suppose that we know that the valuation of each single agent is at most 0.1. As a first attempt of a consensus-estimate, let = the value of rounded to the nearest integer below it. Intuitively, in "most cases", a single agent cannot influence the value of (e.g., if with true reports , then a single agent can only change it to between and , but in all cases ). To make the notion of "most cases" more accurate, define: , where is a random variable drawn uniformly from . This makes a random variable too. With probability at least 90%, cannot be influenced by any single agent, so a mechanism that uses is truthful with high probability. Such random variable is called a consensus estimate: * "Consensus" means that, with high probability, a single agent cannot influence the outcome, so that there is an agreement between the outcomes with or without the agent. * "Estimate" means that the random variable is near the real variable that we are interested in - the variable . The disadvantages of using a consensus estimate are: * It does not give us the optimal profit - but it gives us an approximately-optimal profit. * It is not entirely truthful - it is only "truthful with high probability" (the probability that an agent can gain from deviating goes to 0 when the number of winning agents grows). In practice, instead of rounding down to the nearest integer, it is better to use exponential rounding - rounding down to the nearest power of some constant. In the case of digital goods, using this consensus-estimate allows us to attain at least 1/3.39 of the optimal profit, even in worst-case scenarios.
prov:wasDerivedFrom
wikipedia-en:Consensus_estimate?oldid=1000096059&ns=0
dbo:wikiPageLength
4115
foaf:isPrimaryTopicOf
wikipedia-en:Consensus_estimate