The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Approximate mechanism design without money
Abstract
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot be applied efficiently. Recent years have seen the design of various truthful approximation mechanisms that rely on enforcing payments. In this paper, we advocate the reconsideration of highly structured optimization problems in the context of mechanism design. We argue that, in such domains, approximation can be leveraged to obtain truthfulness without resorting to payments. This stands in contrast to previous work where payments are ubiquitous, and (more often than not) approximation is a necessary evil that is required to circumvent computational complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERS
Vickrey, W. (1961) · The Journal of Finance · doi:10.1111/j.1540-6261.1961.tb02789.x · Cited by 7,722
College Admissions and the Stability of Marriage
Gale, D., & Shapley, L. S. (1962) · The American Mathematical Monthly · doi:10.1080/00029890.1962.11989827 · Cited by 5,985
Groves, T. (1973) · Econometrica · doi:10.2307/1914085 · Cited by 3,284
Multipart pricing of public goods
Clarke, E. H. (1971) · Public Choice · doi:10.1007/bf01726210 · Cited by 3,246
Manipulation of Voting Schemes: A General Result
Gibbard, A. (1973) · Econometrica · doi:10.2307/1914083 · Cited by 3,202
The Theory of Committees and Elections.
Stuart, A., & Black, D. (1959) · Economica · doi:10.2307/2550498 · Cited by 2,822
Satterthwaite, M. A. (1975) · Journal of Economic Theory · doi:10.1016/0022-0531(75)90050-2 · Cited by 2,821
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
On strategy-proofness and single peakedness
Moulin, H. (1980) · Public Choice · doi:10.1007/bf00128122 · Cited by 867
Truth revelation in approximately efficient combinatorial auctions
Lehmann, D., Oćallaghan, L. I., & Shoham, Y. (2002) · Journal of the ACM · doi:10.1145/585265.585266 · Cited by 655
Cited by
Algorithmics of Matching Under Preferences
Manlove, D. F. (2013) · Series on Theoretical Computer Science · doi:10.1142/8591 · Cited by 515
Metadata
- Authors
- Procaccia, A. D., & Tennenholtz, M.
- Venue
- Proceedings of the 10th ACM conference on Electronic commerce
- Publisher
- ACM
- Published
- 2009-07-06
- Pages
- 177-186
- OpenAlex
- W2108957189
- Cited by
- 307
- References
- 34
- FWCI
- 95.40
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximate mechanism design without money. https://app.cochat.ai/papers/10.1145/1566374.1566401
- The paper
- Procaccia, A. D., & Tennenholtz, M. (2009). Approximate mechanism design without money. Proceedings of the 10th ACM conference on Electronic commerce. https://doi.org/10.1145/1566374.1566401
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.