Author:
Herzel Arne,Hopf Michael,Thielen Clemens
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference26 articles.
1. Andelman, N., Azar, Y., & Sorani, M. (2005). Truthful approximation mechanisms for scheduling selfish related machines. In Proceedings of the 22nd international symposium on theoretical aspects of computer science (STACS), volume 3404 of LNCS (pp. 69–82).
2. Andelman, N., Feldman, M., & Mansour, Y. (2007). Strong price of anarchy. In Proceedings of the 18th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 189–198).
3. Archer, A., & Tardos, É. (2001). Truthful mechanisms for one-parameter agents. In Proceedings of the 42nd annual IEEE symposium on the foundations of computer science (FOCS) (pp. 482–491).
4. Arkin, E. M., & Silverberg, E. B. (1987). Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18(1), 1–8.
5. Auletta, V., De Prisco, R., Penna, P., & Persiano, G. (2004). Deterministic truthful approximation mechanisms for scheduling related machines. In Proceedings of the 21st international symposium on theoretical aspects of computer science (STACS), volume 2996 of LNCS (pp. 608–619).