-
1
-
-
33748593645
-
Mechanism design via machine learning
-
IEEE Press
-
M.-F. Balcan, A. Blum, J. D. Hartline, and Y. Mansour. Mechanism design via machine learning. In Proceedings of the 46th Symposium on Foundations of Computer Science (FOCS), pages 605-614. IEEE Press, 2005.
-
(2005)
Proceedings of the 46th Symposium on Foundations of Computer Science (FOCS)
, pp. 605-614
-
-
Balcan, M.-F.1
Blum, A.2
Hartline, J.D.3
Mansour, Y.4
-
2
-
-
33845989821
-
Can machine learning be secure?
-
ACM Press
-
M. Barreno, B. Nelson, R. Sears, A. D. Joseph, and J. D. Tygar. Can machine learning be secure? In Proceedings of the 1st ACM Symposium on Information, Computer and Communications Security (ASIACCS), pages 16-25. ACM Press, 2006.
-
(2006)
Proceedings of the 1st ACM Symposium on Information, Computer and Communications Security (ASIACCS)
, pp. 16-25
-
-
Barreno, M.1
Nelson, B.2
Sears, R.3
Joseph, A.D.4
Tygar, J.D.5
-
3
-
-
0038453192
-
Rademacher and Gaussian complexìties: Rìsk bounds and structural results
-
P. L. Bartlett and S. Mendelson. Rademacher and Gaussian complexìties: Rìsk bounds and structural results. Journal of Machine Learning Research, 3:463-482, 2003.
-
(2003)
Journal of Machine Learning Research
, vol.3
, pp. 463-482
-
-
Bartlett, P.L.1
Mendelson, S.2
-
4
-
-
0037120728
-
PAC learning with nasty noise
-
N. H. Bshouty, N. Eiron, and E. Kushilevitz. PAC learning with nasty noise. Theoretical Computer Science, 288(2):255-275, 2002.
-
(2002)
Theoretical Computer Science
, vol.288
, Issue.2
, pp. 255-275
-
-
Bshouty, N.H.1
Eiron, N.2
Kushilevitz, E.3
-
5
-
-
34250446073
-
Multipart pricing of public goods
-
E. H. Clarke. Multipart pricing of public goods. Public Choice, 11:17-33, 1971.
-
(1971)
Public Choice
, vol.11
, pp. 17-33
-
-
Clarke, E.H.1
-
7
-
-
0013411860
-
Can PAC learning algorithms tolerate random attribute noise?
-
S. A. Goldman and R. H. Sloan. Can PAC learning algorithms tolerate random attribute noise? Algorithmica, 14(1):70-84, 1995.
-
(1995)
Algorithmica
, vol.14
, Issue.1
, pp. 70-84
-
-
Goldman, S.A.1
Sloan, R.H.2
-
8
-
-
0001314984
-
Incentives in teams
-
T. Groves. Incentives in teams. Econometrica, 41:617-631, 1973.
-
(1973)
Econometrica
, vol.41
, pp. 617-631
-
-
Groves, T.1
-
9
-
-
0002192516
-
Decision theoretic generalization of the PAC model for neural net and other learning applications
-
D. Haussler. Decision theoretic generalization of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
-
(1992)
Information and Computation
, vol.100
, Issue.1
, pp. 78-150
-
-
Haussler, D.1
-
10
-
-
0344198507
-
Learnability and rationality of choice
-
G. Kalai. Learnability and rationality of choice. Journal of Economic Theory, 113(1): 104-117, 2003.
-
(2003)
Journal of Economic Theory
, vol.113
, Issue.1
, pp. 104-117
-
-
Kalai, G.1
-
11
-
-
0027640858
-
Learning in the presence of malicious errors
-
M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22(4):807-837, 1993.
-
(1993)
SIAM Journal on Computing
, vol.22
, Issue.4
, pp. 807-837
-
-
Kearns, M.1
Li, M.2
-
12
-
-
0242550383
-
Truth revelation in rapid, approximately efficient combinatorial auctions
-
D. Lehmann, L. I. O'Callaghan, and Y. Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. Journal of the ACM, 49(5):577-602, 2002.
-
(2002)
Journal of the ACM
, vol.49
, Issue.5
, pp. 577-602
-
-
Lehmann, D.1
O'Callaghan, L.I.2
Shoham, Y.3
-
15
-
-
0006796598
-
Generalized Condorcet-winners for single peaked and single-plateau preferences
-
H. Moulin. Generalized Condorcet-winners for single peaked and single-plateau preferences. Social Choice and Welfare, 1(2): 127-147, 1984.
-
(1984)
Social Choice and Welfare
, vol.1
, Issue.2
, pp. 127-147
-
-
Moulin, H.1
-
16
-
-
84926076710
-
Introduction to mechanism design (for computer scientists)
-
N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, chapter 9. Cambridge University Press, To Appear
-
N. Nisan. Introduction to mechanism design (for computer scientists). In N. Nisan, T. Roughgarden, E. Tardos, and V. Vazirani, editors, Algorithmic Game Theory, chapter 9. Cambridge University Press, 2007. To Appear.
-
(2007)
Algorithmic Game Theory
-
-
Nisan, N.1
-
19
-
-
36348938731
-
Learning voting trees
-
A. D. Procaccia, A. Zohar, Y. Peleg, and J. S. Rosenschein. Learning voting trees. In Proceedings of the 22nd Conference on Artificial Intelligence (AAAI), pages 110-115, 2007.
-
(2007)
Proceedings of the 22nd Conference on Artificial Intelligence (AAAI)
, pp. 110-115
-
-
Procaccia, A.D.1
Zohar, A.2
Peleg, Y.3
Rosenschein, J.S.4
-
21
-
-
34247522452
-
Thirteen reasons the Vickrey-Clarke-Groves process is not practical
-
M. Rothkopf. Thirteen reasons the Vickrey-Clarke-Groves process is not practical. Operations Research, 55(2):191-197, 2007.
-
(2007)
Operations Research
, vol.55
, Issue.2
, pp. 191-197
-
-
Rothkopf, M.1
-
23
-
-
84980096808
-
Counter speculation, auctions, and competitive sealed tenders
-
W. Vickrey. Counter speculation, auctions, and competitive sealed tenders. Journal of Finance, 16(1):8-37, 1961.
-
(1961)
Journal of Finance
, vol.16
, Issue.1
, pp. 8-37
-
-
Vickrey, W.1
|