Generalized knapsack solvers for multi-unit combinatorial auctions: analysis and application to computational resource allocation
暂无分享,去创建一个
[1] Noam Nisan,et al. Bidding and allocation in combinatorial auctions , 2000, EC '00.
[2] Jayaram K. Sankaran,et al. Column generation applied to linear programs in course registration , 1995 .
[3] Vijay Kumar,et al. Seller-Focused Algorithms for Online Auctioning , 2001, WADS.
[4] Maiko Shigeno,et al. An Algorithm for Fractional Assignment Problems , 1995, Discret. Appl. Math..
[5] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[6] David Connolly. Knapsack Problems: Algorithms and Computer Implementations , 1991 .
[7] Daniel Dajun Zeng,et al. Storage allocation in web prefetching techniques , 2003, EC '03.
[8] Jose A. Ventura,et al. Single machine scheduling with symmetric earliness and tardiness penalties , 2003, Eur. J. Oper. Res..
[9] Jyrki Wallenius,et al. Emerging multiple issue e-auctions , 2004, Eur. J. Oper. Res..
[10] Michael P. Wellman,et al. Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..
[11] Katarina Stanoevska-Slabeva,et al. Towards the E-Society: E-Commerce, E-Business, and E-Government , 2013 .
[12] David Pisinger. A minimal algorithm for the Multiple-choice Knapsack Problem , 1995 .
[13] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[14] Subhash Suri,et al. Side constraints and non-price attributes in markets , 2006, Games Econ. Behav..
[15] Peter Stone,et al. Self-Enforcing Strategic Demand Reduction , 2002, AMEC.
[16] Muthucumaru Maheswaran,et al. Supporting co-allocation in an auctioning-based resource allocator for grid systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.
[17] Moshe Tennenholtz,et al. Tractable combinatorial auctions and b-matching , 2002, Artif. Intell..
[18] David C. Parkes. Conference report: the third ACM conference on electronic commerce , 2001, SECO.
[19] Yoav Shoham,et al. Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.
[20] Michael P. Wellman,et al. A Parametrization of the Auction Design Space , 2001, Games Econ. Behav..
[21] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[22] E. Maasland,et al. Auction Theory , 2021, Springer Texts in Business and Economics.
[23] David Porter,et al. Combinatorial auction design , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[24] T. Kelly. Utility-Directed Allocation , 2003 .
[25] Venkataraman,et al. RESOURCE ALLOCATION IN COMPETITIVE MULTIAGENT SYSTEMS , 2003 .
[26] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[27] David Pisinger,et al. Where are the hard knapsack problems? , 2005, Comput. Oper. Res..
[28] Peter Stone,et al. Randomized strategic demand reduction: getting more by asking for less , 2002, AAMAS '02.
[29] Arne Andersson,et al. Caching in multi-unit combinatorial auctions , 2002, AAMAS '02.
[30] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[31] Bar-NoyAmotz,et al. A unified approach to approximating resource allocation and scheduling , 2001 .
[32] A. Mas-Colell,et al. Microeconomic Theory , 1995 .
[33] John O. Ledyard,et al. Incentive Compatible Space Station Pricing , 1986 .
[34] Noam Nisan,et al. Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.
[35] Ilya Segal,et al. Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .
[36] Arne Andersson,et al. Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.
[37] Moshe Tennenholtz,et al. An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.
[38] Subhash Suri,et al. Market Clearability , 2001, IJCAI.
[39] Ralph E. Gomory,et al. The Theory and Computation of Knapsack Functions , 1966, Oper. Res..
[40] V. Rich. Personal communication , 1989, Nature.
[41] Pamela H. Vance,et al. Knapsack Problems: Algorithms and Computer Implementations (S. Martello and P. Toth) , 1993, SIAM Rev..
[42] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[43] S. Martello,et al. Algorithms for Knapsack Problems , 1987 .
[44] Daniel Lehmann,et al. Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.
[45] Manoochehr Ghiassi,et al. Defining the Internet-based supply chain system for mass customized markets , 2003, Comput. Ind. Eng..
[46] Margo I. Seltzer,et al. Virtual worlds: fast and strategyproof auctions for dynamic resource allocation , 2003, EC '03.
[47] Robert C. Holte,et al. Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search , 2001, Canadian Conference on AI.
[48] Daniel Lehmann,et al. Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics , 2000, EC '00.
[49] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[50] Robert Sedgewick,et al. Algorithms in C , 1990 .
[51] Manish Gupta,et al. Efficient Winner Determination Techniques for Internet Multi-Unit Auctions , 2001, I3E.
[52] P. Klemperer. Auction Theory: A Guide to the Literature , 1999 .
[53] F. Mackenzie,et al. Exploring the connections: Structural adjustment, gender and the environment , 1993 .
[54] David Pisinger. A Fast Algorithm for Strongly Correlated Knapsack Problems , 1998, Discret. Appl. Math..
[55] Gary J. Koehler,et al. Combinatorial auctions using rule-based bids , 2002, Decis. Support Syst..
[56] Subhash Suri,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003, EC '03.
[57] David D. Yao,et al. The Stochastic Knapsack Revisited: Structure, Switch-Over Policies, and Dynamic Pricing , 2002 .
[58] Andrew B. Whinston,et al. Pricing combinatorial auctions , 2004, Eur. J. Oper. Res..
[59] David Pisinger,et al. Algorithms for Knapsack Problems , 1995 .
[60] Anshul Kothar,et al. Approximately-strategyproof and tractable multi-unit auctions , 2003 .
[61] Noam Nisan,et al. Towards a characterization of truthful combinatorial auctions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[62] Y. Shoham,et al. Resource allocation in competitive multiagent systems , 2003 .
[63] Jayaram K. Sankaran. A monotonic, dual-based bounding procedure for integer programs , 1995, Comput. Oper. Res..
[64] Subhash Suri,et al. Vickrey prices and shortest paths: what is an edge worth? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[65] Jeffrey K. MacKie-Mason,et al. Generalized Vickrey Auctions , 1994 .
[66] David Levine,et al. Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.
[67] Kevin C. Almeroth,et al. On pricing algorithms for batched content delivery systems , 2002, Electron. Commer. Res. Appl..
[68] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[69] Paolo Toth,et al. New trends in exact algorithms for the 0-1 knapsack problem , 2000, Eur. J. Oper. Res..
[70] John R. Smith,et al. Searching dynamically bundled goods with pairwise relations , 2003, EC '03.
[71] Jennifer Widom,et al. Per-user profile replication in mobile environments: Algorithms, analysis, and simulation results , 1997, Mob. Networks Appl..
[72] Dong-Jun Wu,et al. Software agents for knowledge management: coordination in multi-agent supply chains and auctions , 2001, Expert Syst. Appl..
[73] Moshe Tennenholtz. Some Tractable Combinatorial Auctions , 2000, AAAI/IAAI.
[74] John B. Higdon,et al. An Allocation Heuristic for Combinatorial Auctions , 2001 .
[75] Jennifer Widom,et al. User profile replication for faster location lookup in mobile environments , 1995, MobiCom '95.
[76] Ronald V. Book,et al. Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .