Solving the combinatorial double auction problem-Reference-Cited by-同舟云学术

Solving the combinatorial double auction problem

Published:2005-07 Issue:1 Volume:164 Page:239-251
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Xia Mu,Stallaert Jan,Whinston Andrew B.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference17 articles.

1. Optimal investment in knowledge within a firm using a market-mechanism;Ba;Management Science,2001

2. A web-based financial trading system;Fan;IEEE Computer,1999

3. Electronic Commerce and the Revolution in Financial Markets;Fan,2002

4. Fujishima, Y., Leyton-Brown, K., Shoham, Y., 1999. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proc. IJCAF'99, Stockholm, pp. 548–553

5. The traveling salesman problem and spanning trees;Held;Operations Research,1970

Cited by 81 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Zooming in and out the landscape: Artificial intelligence and system dynamics in business and management;Technological Forecasting and Social Change;2024-03

2. A Self-Adaptive Meta-Heuristic Algorithm Based on Success Rate and Differential Evolution for Improving the Performance of Ridesharing Systems with a Discount Guarantee;Algorithms;2023-12-25

3. Improve Decision Making Efficiency in Ridesharing Systems through a Hybrid Firefly-PSO algorithm;2023 IEEE World AI IoT Congress (AIIoT);2023-06-07

4. A two-phase combinatorial double auction and negotiation mechanism for socialized joint reserve mode in emergency preparedness;Socio-Economic Planning Sciences;2023-06

5. Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework;Information Systems Research;2022-12