-
1
-
-
33244492376
-
Algorithms for multi-product pricing
-
Diaz, J, Karhumäki, J, Lepistö, A, Sannella, D, eds, ICALP 2004, Springer, Heidelberg
-
Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 72-83. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3142
, pp. 72-83
-
-
Aggarwal, G.1
Feder, T.2
Motwani, R.3
Zhu, A.4
-
2
-
-
33748702881
-
Approximation algorithms and online mechanisms for item pricing
-
ACM, New York
-
Balcan, M.F., Blum, A.: Approximation algorithms and online mechanisms for item pricing. In: Proc. 7th ACM Conf. Electronic Commerce, pp. 29-35. ACM, New York (2006)
-
(2006)
Proc. 7th ACM Conf. Electronic Commerce
, pp. 29-35
-
-
Balcan, M.F.1
Blum, A.2
-
3
-
-
33748593645
-
Mechanism design via machine learning
-
Balcan, M.F., Blum, A., Hartline, J.D., Mansour, Y.: Mechanism design via machine learning. In: Proc. 46th IEEE Found. Comp. Sci., FOCS 2005, pp. 605-614 (2005)
-
(2005)
Proc. 46th IEEE Found. Comp. Sci
, vol.FOCS 2005
, pp. 605-614
-
-
Balcan, M.F.1
Blum, A.2
Hartline, J.D.3
Mansour, Y.4
-
4
-
-
33244473772
-
Single-minded unlimited supply pricing on sparse instances
-
SODA
-
Briest, P., Krysta, P.: Single-minded unlimited supply pricing on sparse instances. In: Proc. 17th ACM-SIAM Symp. Discr. Alg., SODA 2006, pp. 1093-1102 (2006)
-
(2006)
Proc. 17th ACM-SIAM Symp. Discr. Alg
, pp. 1093-1102
-
-
Briest, P.1
Krysta, P.2
-
5
-
-
33244477826
-
Combination can be hard: Approximability of the unique coverage problem
-
SODA
-
Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination can be hard: Approximability of the unique coverage problem. In: Proc. 17th ACM-SIAM Symp. Discr. AIg., SODA 2006, pp. 162-171 (2006)
-
(2006)
Proc. 17th ACM-SIAM Symp. Discr. AIg
, pp. 162-171
-
-
Demaine, E.D.1
Feige, U.2
Hajiaghayi, M.T.3
Salavatipour, M.R.4
-
7
-
-
33645899948
-
Competitive auctions
-
Goldberg, A.V., Hartline, J.D., Karlin, A.R., Saks, M., Wright, A.: Competitive auctions. Games and Economic Behavior 55, 242-269 (2006)
-
(2006)
Games and Economic Behavior
, vol.55
, pp. 242-269
-
-
Goldberg, A.V.1
Hartline, J.D.2
Karlin, A.R.3
Saks, M.4
Wright, A.5
-
8
-
-
33845519057
-
-
Grigoriev, A., van Loon, J., Sitters, R., Uetz, M.: How to sell a graph: Guidelines for graph retailers. In: Fomin, F.V. (ed.) WG 2006. LNCS, 4271, pp. 125-136. Springer, Heidelberg (2006)
-
Grigoriev, A., van Loon, J., Sitters, R., Uetz, M.: How to sell a graph: Guidelines for graph retailers. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 125-136. Springer, Heidelberg (2006)
-
-
-
-
9
-
-
20744457725
-
On profit-maximizing envy-free pricing
-
SODA
-
Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proc. 16th ACM-SIAM Symp. Discr. Alg., SODA 2005, pp. 1164-1173 (2005)
-
(2005)
Proc. 16th ACM-SIAM Symp. Discr. Alg
, pp. 1164-1173
-
-
Guruswami, V.1
Hartline, J.D.2
Karlin, A.R.3
Kempe, D.4
Kenyon, C.5
McSherry, F.6
-
10
-
-
26844449083
-
-
Hartline, J.D., Koltun, V.: Near-optimal pricing in near-linear time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, 3608, pp. 422-431. Springer, Heidelberg (2005)
-
Hartline, J.D., Koltun, V.: Near-optimal pricing in near-linear time. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 422-431. Springer, Heidelberg (2005)
-
-
-
-
12
-
-
33749024041
-
Linear degree extractors and the inapproximability of max clique and chromatic number
-
TR05-100
-
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number, ECCC Report TR05-100 (2005), http://www.eccc.uni- trier.de/eccc/
-
(2005)
ECCC Report
-
-
Zuckerman, D.1
|