-
1
-
-
52149105620
-
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
-
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
-
3
-
-
24144461814
-
-
Ph.D. thesis, Cornell University, Ithaca, NY
-
A. Archer, Mechanisms for Discrete Optimization with Rational Agents, Ph.D. thesis, Cornell University, Ithaca, NY, 2004.
-
(2004)
Mechanisms for Discrete Optimization with Rational Agents
-
-
Archer, A.1
-
4
-
-
0035176099
-
Truthful mechanisms for one-parameter agents
-
A. Archer and É. Tardos, Truthful mechanisms for one-parameter agents, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 2001, pp. 482-491. (Pubitemid 33068409)
-
(2001)
Annual Symposium on Foundations of Computer Science - Proceedings
, pp. 482-491
-
-
Archer, A.1
Tardos, E.2
-
5
-
-
35048830423
-
Deterministic truthful approximation mechanisms for scheduling related machines
-
Springer-Verlag, Berlin, New York
-
V. Auletta, R. De Prisco, P. Penna, and G. Persiano, Deterministic truthful approximation mechanisms for scheduling related machines, in Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Comput. Sci. 2996, Springer-Verlag, Berlin, New York, 2004, pp. 608-619.
-
(2004)
Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Comput. Sci.
, vol.2996
, pp. 608-619
-
-
Auletta, V.1
De Prisco, R.2
Penna, P.3
Persiano, G.4
-
6
-
-
84958985957
-
Approximation schemes for covering and scheduling on related machines
-
Springer-Verlag, Berlin, New York
-
Y. Azar and L. Epstein, Approximation schemes for covering and scheduling on related machines, in Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Comput. Sci. 1444, Springer-Verlag, Berlin, New York, 1998, pp. 39-47.
-
(1998)
Proceedings of the First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), Lecture Notes in Comput. Sci.
, vol.1444
, pp. 39-47
-
-
Azar, Y.1
Epstein, L.2
-
7
-
-
77951673980
-
Inapproximability for VCG-based combinatorial auctions
-
D. Buchfuhrer, S. Dughmi, H. Fu, R. Kleinberg, E. Mossel, C. Papadimitriou, M. Schapira, Y. Singer, and C. Umans, Inapproximability for VCG-based combinatorial auctions, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2010, pp. 518-536.
-
(2010)
Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia
, pp. 518-536
-
-
Buchfuhrer, D.1
Dughmi, S.2
Fu, H.3
Kleinberg, R.4
Mossel, E.5
Papadimitriou, C.6
Schapira, M.7
Singer, Y.8
Umans, C.9
-
8
-
-
77951679443
-
A deterministic truthful PTAS for scheduling related machines
-
Philadelphia
-
G. Christodoulou and A. Kovács, A deterministic truthful PTAS for scheduling related machines, in Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, Philadelphia, 2010, pp. 1005-1016.
-
(2010)
Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM
, pp. 1005-1016
-
-
Christodoulou, G.1
Kovács, A.2
-
9
-
-
34250446073
-
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
-
10
-
-
78751564971
-
Black-box randomized reductions in algorithmic mechanism design
-
IEEE Press, Piscataway, NJ
-
S. Dughmi and T. Roughgarden, Black-box randomized reductions in algorithmic mechanism design, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscataway, NJ, 2010, pp. 775-784.
-
(2010)
Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 775-784
-
-
Dughmi, S.1
Roughgarden, T.2
-
11
-
-
21044439058
-
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
-
12
-
-
43049141881
-
Maximizing the minimum load for selfish agents
-
DOI 10.1007/978-3-540-78773-0-23, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings
-
L. Epstein and R. van Stee, Maximizing the minimum load for selfish agents, in Proceedings of the 8th Conference on Latin American Theoretical Informatics (LATIN), Lecture Notes in Comput. Sci. 4957, Springer-Verlag, Berlin, New York, 2008, pp. 264-275. (Pubitemid 351632193)
-
(2008)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4957 LNCS
, pp. 264-275
-
-
Epstein, L.1
Van Stee, R.2
-
13
-
-
0001314984
-
Incentives in teams
-
T. Groves, Incentives in teams, Econometrica, 41 (1973), pp. 617-631.
-
(1973)
Econometrica
, vol.41
, pp. 617-631
-
-
Groves, T.1
-
14
-
-
77954691037
-
Bayesian algorithmic mechanism design
-
ACM, New York
-
J. D. Hartline and B. Lucier, Bayesian algorithmic mechanism design, in Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2010, pp. 301-310.
-
(2010)
Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC)
, pp. 301-310
-
-
Hartline, J.D.1
Lucier, B.2
-
15
-
-
0024018137
-
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
-
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
-
17
-
-
33746065270
-
Tighter approximation bounds for LPT scheduling in two special cases
-
Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings
-
A. Kovács, Tighter approximation bounds for LPT scheduling in two special cases, in Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC), Lecture Notes in Comput. Sci. 3998, Springer-Verlag, Berlin, New York, 2006, pp. 187-198. (Pubitemid 44071025)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.3998 LNCS
, pp. 187-198
-
-
Kovacs, A.1
-
18
-
-
57949116749
-
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
-
19
-
-
0344981431
-
Towards a characterization of truthful combinatorial auctions
-
IEEE Press, Piscatway, NJ
-
R. Lavi, A. Mu'alem, and N. Nisan, Towards a characterization of truthful combinatorial auctions, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscatway, NJ, 2003, pp. 574-583.
-
(2003)
Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 574-583
-
-
Lavi, R.1
Mu'Alem, A.2
Nisan, N.3
-
20
-
-
0001845798
-
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
-
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
-
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
-
23
-
-
57949083485
-
On the hardness of being truthful
-
IEEE Press, Piscatway, NJ
-
C. H. Papadimitriou, M. Schapira, and Y. Singer, On the hardness of being truthful, in Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Press, Piscatway, NJ, 2008, pp. 250-259.
-
(2008)
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS)
, pp. 250-259
-
-
Papadimitriou, C.H.1
Schapira, M.2
Singer, Y.3
|