Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[2] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[3] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.
[4] Kurt Mehlhorn,et al. An o(n³)-Time Algorithm Maximum-Flow Algorithm , 1996, SIAM J. Comput..
[5] John Dickhaut,et al. Price Formation in Double Auctions , 2001, E-Commerce Agents.
[6] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[7] F. Sibel Salman,et al. Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem , 2002, J. Heuristics.
[8] Torben Hagerup,et al. A Randomized Maximum-Flow Algorithm , 1995, SIAM J. Comput..