Algorithmic Mechanism Design.¶
Nisan, N., & Ronen, A. (1999). Algorithmic Mechanism Design. Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC 1999), 129-140.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Incentive Compatibility
- now influencing platform-scale auction and allocation designs from ad networks to spectrum auctions.
This sourceFounding paper of algorithmic mechanism design.
- now influencing platform-scale auction and allocation designs from ad networks to spectrum auctions.
- Mechanism Design
- This field adds computational tractability constraints to classical mechanism design, often accepting approximation to maintain implementability.
This sourceFounding paper of algorithmic mechanism design.
Supported in partVerified against the publisher's abstract
The abstract applies mechanism-design tools to algorithmic problems and reports an approximation mechanism, backing the field's frame but not the general tractability claim.
“We apply the standard tools of mechanism design to algorithmic problems and in particular to the shortest path problem.”
- This field adds computational tractability constraints to classical mechanism design, often accepting approximation to maintain implementability.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 1 other way.
Registry ID ref:ab2f81ed9de1 · see in the full table