-
3
-
-
0032141895
-
Computationally manageable combinatorial auctions
-
Rothkopf, M.H., Pekec, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science 44 (1998) 1131-1147
-
(1998)
Management Science
, vol.44
, pp. 1131-1147
-
-
Rothkopf, M.H.1
Pekec, A.2
Harstad, R.M.3
-
5
-
-
85040831051
-
Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics
-
Gonen, R., Lehmann, D.: Optimal solutions for multi-unit combinatorial auctions: Branch and bound heuristics. In: ACM E-Commerce. (2000)
-
(2000)
ACM E-commerce
-
-
Gonen, R.1
Lehmann, D.2
-
6
-
-
84962097349
-
Integer programming for combinatorial auction winner determination
-
Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: ICMAS. (2000)
-
(2000)
ICMAS
-
-
Andersson, A.1
Tenhunen, M.2
Ygge, F.3
-
7
-
-
0003142374
-
A parametrization of the auction design space
-
Wurman, P.R., Wellman, M.P., Walsh, W.E.: A parametrization of the auction design space. Games and Economic Behavior 35 (2001) 304-338
-
(2001)
Games and Economic Behavior
, vol.35
, pp. 304-338
-
-
Wurman, P.R.1
Wellman, M.P.2
Walsh, W.E.3
-
11
-
-
0242550383
-
Truth revelation in approximately efficient combinatorial auctions
-
Lehmann, D., O'Callaghan, L., Shoham, Y.: Truth revelation in approximately efficient combinatorial auctions. Journal of the ACM 49 (2002) 577-602
-
(2002)
Journal of the ACM
, vol.49
, pp. 577-602
-
-
Lehmann, D.1
O'Callaghan, L.2
Shoham, Y.3
-
13
-
-
33744821450
-
Towards a characterization of truthful combinatorial auctions
-
Lavi, R., Mu'alem, A., Nisan, N.: Towards a characterization of truthful combinatorial auctions (extended abstract). In: IEEE FOCS. (2003)
-
(2003)
IEEE FOCS
-
-
Lavi, R.1
Mu'Alem, A.2
Nisan, N.3
-
14
-
-
4544244802
-
Generalized knapsack solvers for multi-unit combinatorial auctions
-
HP Labs
-
Kelly, T.: Generalized knapsack solvers for multi-unit combinatorial auctions. Technical Report HPL-2004-21, HP Labs (2004)
-
(2004)
Technical Report
, vol.HPL-2004-21
-
-
Kelly, T.1
-
18
-
-
84928446246
-
Incentive compatible space station pricing
-
Ledyard, J.O.: Incentive compatible space station pricing. American Economic Review 76 (1987) 274-279
-
(1987)
American Economic Review
, vol.76
, pp. 274-279
-
-
Ledyard, J.O.1
-
22
-
-
0242624709
-
Approximatcly-strategyproof and tractable multi-unit auctions
-
Kothari, A., Parkes, D.C., Suri, S.: Approximatcly-strategyproof and tractable multi-unit auctions. In: ACM E-Commcrce. (2003)
-
(2003)
ACM E-commcrce
-
-
Kothari, A.1
Parkes, D.C.2
Suri, S.3
-
23
-
-
0032208665
-
Flexible double auctions for electronic commerce: Theory and implementation
-
Wurman, P.R., Walsh, W.E., Wellman, M.P.: Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24 (1998) 17-27
-
(1998)
Decision Support Systems
, vol.24
, pp. 17-27
-
-
Wurman, P.R.1
Walsh, W.E.2
Wellman, M.P.3
-
24
-
-
0011986321
-
Combinatorial auctions with decreasing marginal utilities
-
Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: ACM E-Commerce. (2001)
-
(2001)
ACM E-commerce
-
-
Lehmann, B.1
Lehmann, D.2
Nisan, N.3
-
25
-
-
33744791866
-
-
Personal communication
-
Walsh, W.: Personal communication (2003)
-
(2003)
-
-
Walsh, W.1
-
26
-
-
33744826369
-
Winner determination in combinatorial auction generalizations
-
Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Winner determination in combinatorial auction generalizations. In: AAMAS. (2002)
-
(2002)
AAMAS
-
-
Sandholm, T.1
Suri, S.2
Gilpin, A.3
Levine, D.4
-
27
-
-
0037897397
-
A minimal algorithm for the multiple-choice knapsack problem
-
Pisinger, D.: A minimal algorithm for the multiple-choice knapsack problem. European Journal of Operations Research 83 (1995) 394-410
-
(1995)
European Journal of Operations Research
, vol.83
, pp. 394-410
-
-
Pisinger, D.1
-
28
-
-
84949430733
-
Combinatorial auctions, knapsack problems, and hill-climbing search
-
Stroulia, E., Matwin, S., eds.: Springer
-
Holte, R.C.: Combinatorial auctions, knapsack problems, and hill-climbing search. In Stroulia, E., Matwin, S., eds.: Lee. Notes in CS. Volume 2056. Springer (2001)
-
(2001)
Lee. Notes in CS
, vol.2056
-
-
Holte, R.C.1
-
31
-
-
33744796894
-
-
See page 215 of the 8th printing (August 2001) for a remarkably clear and compact integer knapsack solver in C
-
Sedgewick, R.: Algorithms in C. Addison-Wesley (1998) See page 215 of the 8th printing (August 2001) for a remarkably clear and compact integer knapsack solver in C.
-
(1998)
Algorithms in C. Addison-Wesley
-
-
Sedgewick, R.1
-
34
-
-
84978068591
-
Towards a universal test suite for combinatorial auction algorithms
-
Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM E-Commerce. (2000)
-
(2000)
ACM E-commerce
-
-
Leyton-Brown, K.1
Pearson, M.2
Shoham, Y.3
-
35
-
-
0009625877
-
Hard knapsack problems
-
Chvátal, V.: Hard knapsack problems. Operations Research 28 (1980) 1402-1411
-
(1980)
Operations Research
, vol.28
, pp. 1402-1411
-
-
Chvátal, V.1
-
36
-
-
0004218571
-
-
PhD thesis, University of Copenhagen
-
Pisinger, D.: Algorithms for Knapsack Problems. PhD thesis, University of Copenhagen (1995) http://www.diku.dk/users/pisinger/95-1.pdf.
-
(1995)
Algorithms for Knapsack Problems
-
-
Pisinger, D.1
-
37
-
-
0033894212
-
New trends in exact algorithms for the 0-1 knapsack problem
-
Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0-1 knapsack problem. European Journal of Operational Research 123 (2000) 325-332
-
(2000)
European Journal of Operational Research
, vol.123
, pp. 325-332
-
-
Martello, S.1
Pisinger, D.2
Toth, P.3
-
38
-
-
0004228502
-
A fast algorithm for strongly correlated knapsack problems
-
Pisinger, D.: A fast algorithm for strongly correlated knapsack problems. Discrete Applied Mathematics 89 (1998) 197-212
-
(1998)
Discrete Applied Mathematics
, vol.89
, pp. 197-212
-
-
Pisinger, D.1
-
39
-
-
0032804976
-
Auction theory: A guide to the literature
-
Klemperer, P.: Auction theory: A guide to the literature. Journal of Economic Surveys 13 (1999) 227-260
-
(1999)
Journal of Economic Surveys
, vol.13
, pp. 227-260
-
-
Klemperer, P.1
-
40
-
-
0141495795
-
-
Academic Press ISBN 0-12-426297-X
-
Krishna, V.: Auction Theory. Academic Press (2002) ISBN 0-12-426297-X.
-
(2002)
Auction Theory
-
-
Krishna, V.1
-
42
-
-
0036467861
-
Algorithm for optimal winner determination in combinatorial auctions
-
Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135 (2002) 1-54
-
(2002)
Artificial Intelligence
, vol.135
, pp. 1-54
-
-
Sandholm, T.1
-
43
-
-
85087597405
-
Efficient winner-determination techniques for Internet multi-unit auctions
-
Bassamboo, A., Gupta, M., Juneja, S.: Efficient winner-determination techniques for Internet multi-unit auctions. In: Proceedings of the First IFIP Conference on E-Commerce, E-Business, and E-Government. Volume 202. (2001)
-
(2001)
Proceedings of the First IFIP Conference on E-commerce, E-business, and E-government
, vol.202
-
-
Bassamboo, A.1
Gupta, M.2
Juneja, S.3
-
45
-
-
0036724444
-
Tractable combinatorial auctions and b-matching
-
Tennenholtz, M.: Tractable combinatorial auctions and b-matching. Artificial Intelligence 140 (2002) 231-243
-
(2002)
Artificial Intelligence
, vol.140
, pp. 231-243
-
-
Tennenholtz, M.1
-
46
-
-
33744785484
-
Caching in multi-unit combinatorial auctions
-
Ghebreamiak, K.A., Andersson, A.: Caching in multi-unit combinatorial auctions. In: AA- MAS. (2002)
-
(2002)
AA- MAS
-
-
Ghebreamiak, K.A.1
Andersson, A.2
|