A sufficient condition for truthfulness with single parameter agents
Authors:
Open Access
- 11 June 2006
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 8-17
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Auctions with Budget ConstraintsLecture Notes in Computer Science, 2004
- An approximation algorithm for the generalized assignment problemMathematical Programming, 1993
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation ApproachSIAM Journal on Computing, 1988
- A necessary and sufficient condition for rationalizability in a quasi-linear contextJournal of Mathematical Economics, 1987
- Optimal tax theoryJournal of Public Economics, 1976
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Competitive and optimal responses to signals: An analysis of efficiency and distributionJournal of Economic Theory, 1974
- Incentives in TeamsEconometrica, 1973
- Multipart pricing of public goodsPublic Choice, 1971
- COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERSThe Journal of Finance, 1961