메뉴 건너뛰기




Volumn 40, Issue 3, 2011, Pages 915-933

Truthful approximation schemes for single-parameter agents

Author keywords

Algorithm game theory; Algorithmic mechanism design; Scheduling

Indexed keywords

A-MONOTONE; ALGORITHMIC MECHANISM DESIGN; ALGORITHMIC TECHNIQUES; MAKESPAN; MAX-MIN; PARALLEL RELATED MACHINES; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; RELATED MACHINES; SINGLE-PARAMETER AGENTS; TRUTHFUL APPROXIMATION;

EID: 79960359485     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/080744992     Document Type: Conference Paper
Times cited : (27)

References (25)
  • 1
    • 52149105620 scopus 로고    scopus 로고
    • Deterministic monotone algorithms for scheduling on related machines
    • P. Ambrosio and V. Auletta, Deterministic monotone algorithms for scheduling on related machines, Theoret. Comput. Sci., 406 (2008), pp. 173-186.
    • (2008) Theoret. Comput. Sci. , vol.406 , pp. 173-186
    • Ambrosio, P.1    Auletta, V.2
  • 2
    • 34547224625 scopus 로고    scopus 로고
    • Truthful approximation mechanisms for scheduling selfish related machines
    • N. Andelman, Y. Azar, and M. Sorani, Truthful approximation mechanisms for scheduling selfish related machines, Theory Comput. Syst., 40 (2007), pp. 423-436.
    • (2007) Theory Comput. Syst. , vol.40 , pp. 423-436
    • Andelman, N.1    Azar, Y.2    Sorani, M.3
  • 9
    • 34250446073 scopus 로고
    • Multipart pricing of public goods
    • E. H. Clarke, Multipart pricing of public goods, Public Choice, 11 (1971), pp. 17-33.
    • (1971) Public Choice , vol.11 , pp. 17-33
    • Clarke, E.H.1
  • 11
    • 21044439058 scopus 로고    scopus 로고
    • Approximation schemes for scheduling on uniformly related and identical parallel machines
    • DOI 10.1007/s00453-003-1077-7
    • L. Epstein and J. Sgall, Approximation schemes for scheduling on uniformly related and identical parallel machines, Algorithmica, 39 (2004), pp. 43-57. (Pubitemid 40871672)
    • (2004) Algorithmica (New York) , vol.39 , Issue.1 , pp. 43-57
    • Epstein, L.1    Sgall, J.2
  • 13
    • 0001314984 scopus 로고
    • Incentives in teams
    • T. Groves, Incentives in teams, Econometrica, 41 (1973), pp. 617-631.
    • (1973) Econometrica , vol.41 , pp. 617-631
    • Groves, T.1
  • 15
    • 0024018137 scopus 로고
    • A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
    • D. S. Hochbaum and D. B. Shmoys, A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach, SIAM J. Comput., 17 (1988), pp. 539-551.
    • (1988) SIAM J. Comput. , vol.17 , pp. 539-551
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 16
    • 27144510585 scopus 로고    scopus 로고
    • Fast monotone 3-approximation algorithm for scheduling related machines
    • Algorithms - ESA 2005: 13th Annual European Symposium. Proceedings
    • A. Kovács, Fast monotone 3-approximation algorithm for scheduling related machines, in Proceedings of the 13th Annual European Symposium on Algorithms (ESA), Lecture Notes in Comput. Sci. 3669, Springer-Verlag, Berlin, New York, 2005, pp. 616-627. (Pubitemid 41491561)
    • (2005) Lecture Notes in Computer Science , vol.3669 , pp. 616-627
    • Kovacs, A.1
  • 18
    • 57949116749 scopus 로고    scopus 로고
    • Computationally efficient approximation mechanisms
    • N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK
    • R. Lavi, Computationally efficient approximation mechanisms, in Algorithmic Game Theory, N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK, 2007, pp. 301-329.
    • (2007) Algorithmic Game Theory , pp. 301-329
    • Lavi, R.1
  • 20
    • 0001845798 scopus 로고
    • Optimal auction design
    • R. Myerson, Optimal auction design, Math. Oper. Res., 6 (1981), pp. 58-73.
    • (1981) Math. Oper. Res. , vol.6 , pp. 58-73
    • Myerson, R.1
  • 21
    • 84926076710 scopus 로고    scopus 로고
    • Introduction to mechanism design (for computer scientists)
    • N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK
    • N. Nisan, Introduction to mechanism design (for computer scientists), in Algorithmic Game Theory, N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, eds., Cambridge University Press, Cambridge, UK, 2007, pp. 209-241.
    • (2007) Algorithmic Game Theory , pp. 209-241
    • Nisan, N.1
  • 22
    • 0000421874 scopus 로고    scopus 로고
    • Algorithmic mechanism design
    • DOI 10.1006/game.1999.0790
    • N. Nisan and A. Ronen, Algorithmic mechanism design, Games Econom. Behav., 35 (2001), pp. 166-196. (Pubitemid 33668164)
    • (2001) Games and Economic Behavior , vol.35 , Issue.1-2 , pp. 166-196
    • Nisan, N.1    Ronen, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.