The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Truth revelation in approximately efficient combinatorial auctions
Abstract
Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA). Traditional analysis of these mechanisms---in particular, their truth revelation properties---assumes that the optimization problems are solved precisely. In reality, these optimization problems can usually be solved only in an approximate fashion. We investigate the impact on such mechanisms of replacing exact solutions by approximate ones. Specifically, we look at a particular greedy optimization method. We show that the GVA payment scheme does not provide for a truth revealing mechanism. We introduce another scheme that does guarantee truthfulness for a restricted class of players. We demonstrate the latter property by identifying natural properties for combinatorial auctions and showing that, for our restricted class of players, they imply that truthful strategies are dominant. Those properties have applicability beyond the specific auction studied.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Myerson, R. B. (1981) · Mathematics of Operations Research · doi:10.1287/moor.6.1.58 · Cited by 5,920
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
Roughgarden, T., & Tardos, É. (2002) · Journal of the ACM · doi:10.1145/506147.506153 · Cited by 1,608
Clique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
Computationally Manageable Combinational Auctions
Rothkopf, M. H., Pekeč, A., & Harstad, R. M. (1998) · Management Science · doi:10.1287/mnsc.44.8.1131 · Cited by 1,024
Algorithm for optimal winner determination in combinatorial auctions
Sandholm, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(01)00159-x · Cited by 929
McMillan, J. (1994) · The Journal of Economic Perspectives · doi:10.1257/jep.8.3.145 · Cited by 699
Putting Auction Theory to Work: The Simultaneous Ascending Auction
Milgrom, P. (2000) · Journal of Political Economy · doi:10.1086/262118 · Cited by 678
Bidding and allocation in combinatorial auctions
Nisan, N. (2000) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/352871.352872 · Cited by 534
Truthful mechanisms for one-parameter agents
Archer, A. F., & Eva Tardos, D. (2001) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959924 · Cited by 519
Algorithmic mechanism design (extended abstract)
Nisan, N., & Ronen, A. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301287 · Cited by 476
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
Fujishima, Y., Leyton‐Brown, K., & Shoham, Y. (1999) · International Joint Conference on Artificial Intelligence · Cited by 440
Self-citationAn Algorithm for Optimal Winner Determination in Combinatorial Auctions
Sandholm, T. (1999) · Open Scholarship Institutional Repository (Washington University in St. Louis) · doi:10.7936/k74j0cb1 · Cited by 325
Computationally feasible VCG mechanisms
Nisan, N., & Ronen, A. (2000) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/352871.352898 · Cited by 322
Truthful approximation mechanisms for restricted combinatorial auctions
Mu’alem, A., & Nisan, N. (2008) · Games and Economic Behavior · doi:10.1016/j.geb.2007.12.009 · Cited by 317
A New and Improved Design for Multiobject Iterative Auctions
Kwasnica, A. M., Ledyard, J. O., Porter, D., & DeMartini, C. (2005) · Management Science · doi:10.1287/mnsc.1040.0334 · Cited by 282
Economic mechanism design for computerized agents
Varian, H. R. (1995) · Cited by 274
Combinatorial auctions with decreasing marginal utilities
Lehmann, B., Lehmann, D., & Nisan, N. (2001) · Proceedings of the 3rd ACM conference on Electronic Commerce · doi:10.1145/501158.501161 · Cited by 230
Self-citationTruth Revelation in Rapid, Approximately Efficient Combinatorial Auctions
Lehmann, D. J., O'Callaghan, L., & Shoham, Y. (n.d.) · Cited by 223
Self-citationApplications of approximation algorithms to cooperative games
Jain, K., & Vazirani, V. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380825 · Cited by 211
Complexity of Computer Computations
Rice, J. R., Miller, R. E., & Thatcher, J. W. (1974) · Mathematics of Computation · doi:10.2307/2005950 · Cited by 205
Incentive compatible multi unit combinatorial auctions
Bartal, Y., Gonen, R., & Nisan, N. (2003) · Theoretical Aspects of Rationality and Knowledge · doi:10.1145/846241.846250 · Cited by 196
Bidding languages for combinatorial auctions
Boutilier, C. E., & Hoos, H. H. (2001) · Cited by 160
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Gonen, R., & Lehmann, D. J. (2000) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/352871.352873 · Cited by 148
Self-citationGeneralized Vickrey AuctionsPreprint
Varian, H. R., & MacKie–Mason, J. K. (2007) · SSRN Electronic Journal · doi:10.2139/ssrn.975873 · Cited by 121
Nisan, N. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49116-3_1 · Cited by 109
Truth revelation in approximately efficient combinatorial auctions
Lehmann, D. J., O'Callaghan, L., & Shoham, Y. (1999) · ACM Conference on Electronic Commerce (EC) · doi:10.1145/336992.337016 · Cited by 107
Self-citationEfficient Mechanism DesignPreprint
Krishna, V., & Perry, M. (1997) · SSRN Electronic Journal · doi:10.2139/ssrn.64934 · Cited by 103
eMediator: a next generation electronic commerce server
Sandholm, T. (2000) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/336595.337522 · Cited by 100
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract
Mu’alem, A., & Nisan, N. (2002) · National Conference on Artificial Intelligence · doi:10.5555/777092.777153 · Cited by 96
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Self-citationPutting Auction Theory to Work
Milgrom, P. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511813825 · Cited by 1,642
Nisan, N., & Ronen, A. (2001) · Games and Economic Behavior · doi:10.1006/game.1999.0790 · Cited by 1,331
Approximate mechanism design without money
Procaccia, A. D., & Tennenholtz, M. (2009) · Proceedings of the 10th ACM conference on Electronic commerce · doi:10.1145/1566374.1566401 · Cited by 307
Competitive auctions and digital goods
Goldberg, A. V., Hartline, J. D., & Wright, A. (2001) · doi:10.5555/365411.365768 · Cited by 257
Metadata
- Authors
- Lehmann, D., Oćallaghan, L. I., & Shoham, Y.
- Venue
- Journal of the ACM
- Published
- 2002-09
- Volume
- 49
- Issue
- 5
- Pages
- 577-602
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2062830639
- Cited by
- 655
- References
- 35
- FWCI
- 56.85
- Type
- journal article
- 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
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.