Author:
Carroll Thomas E.,Grosu Daniel
Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference38 articles.
1. N. Andelman, Y. Azar, M. Sorani, Truthful approximation mechanism for scheduling selfish related machines, in: Proc. of the 22nd International Symp. on Theoretical Aspects of Comp. Sci., STACS’05, 2005, pp. 69–82.
2. N. Andelman, Y. Mansour, A sufficient condition for truthfulness with single parameter agents, in: Proc. of the 7th ACM Conf. on Electronic Commerce, EC’06, 2006, pp. 8–17.
3. E. Angel, E. Bampis, F. Pascual, Truthful algorithms for scheduling selfish tasks on parallel machines, in: Proc. of the 1st Workshop on Internet and Network Economics, WINE’05, December 2005, pp. 698–707.
4. A. Archer, E. Tardos, Truthful mechanism for one-parameter agents, in: Proc. of the 42nd IEEE Symp. on Foundations of Computer Science, FOCS’01, October 2001, pp. 482–491.
5. A. Archer, E. Tardos, Frugal path mechanisms, in: Proc. of the 13th Annual ACM–SIAM Symp. on Discrete Algorithms, SODA’02, January 2002 pp. 991–999.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献