1. Andelman, N., Mansour, Y.: A sufficient condition for
truthfulness with single parameter agents. In: Proc. 8th ACM Conference on
Electronic Commerce (EC),Ann, Arbor, Michigan, June (2006)
2. Archer, A., Papadimitriou, C.H., Talwar, K., Tardos,
E.: An approximate truthful mechanism for combinatorial auctions with single
parameter agents. In: Proc. 14th Ann. ACM–SIAM Symp. on Discrete Algorithms
(SODA), pp. 205–214. Baltimore, Maryland (2003)
3. Awerbuch, B., Azar, Y., Meyerson, A.: Reducing
truth-telling online mechanisms to online optimization. In: Proc. 35th
Ann. ACM. Symp. on Theory of Comput. (STOC), San Diego, California (2003)
4. Azar, Y., Gamzu, I., Gutner, S.: Truthful unsplittable flow
for large capacity networks. In: Proc. 19th Ann. ACM Symp. on Parallelism in
Algorithms and Architectures (SPAA), pp. 320–329 (2007)
5. Bartal, Y., Gonen, R., Nisan, N.: Incentive compatible
multi unit combinatorial auctions. In: Proceedings of the 9th conference on
Theoretical aspects of rationality and knowledge (TARK), pp. 72–87. ACM Press
(2003).
http://doi.acm.org/10.1145/846241.846250