Economic metaphors for solving intrafirm allocation problems: What does a market buy us?

Decision Support Systems

Volumn 42, Issue 3, 2006, Pages 1657-1672

  Brydon, Michael ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Combinatorial auctions; Internal markets; Local search; Multiagent systems; Production scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MULTI AGENT SYSTEMS; ONLINE SEARCHING; PROBLEM SOLVING; RANDOM PROCESSES; RESOURCE ALLOCATION; SCHEDULING;

COMBINATORIAL AUCTIONS; LOCAL MAXIMA PROBLEMS; METAPHORS; RESOURCE ALLOCATION PROBLEMS;

ELECTRONIC COMMERCE;

EID: 33750449346     PISSN: 01679236     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dss.2006.02.009     Document Type: Article

References (28)

1. Ba S., Stallaert J., and Whinston A.B. Optimal investment in knowledge within a firm using a market mechanism. Management Science 47 9 (2001) 1203-1219
2. Bertsekas D.P. Auction algorithms for network flow problems. Computational Optimization and its Applications 1 (1992) 7-66
3. Boutilier C., Dean T., and Hanks S. Decision-theoretic planning: structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11 (1999) 1-94
4. Michael J. Brydon, 2000, "A Market-Based Approach to Resource Allocation in Manufacturing," unpublished Ph.D. dissertation, Faculty of Commerce and Business Administration, University of British Columbia.
5. Brydon M.J. Using Decision-Theoretic Planning Agents in Market-Based Systems. The Proceedings of the 2002 Workshop on Game Theoretic and Decision Theoretic Agents (GTDT '02), Edmonton, Canada (July 28 2002) 19-28
6. Dearden R., and Boutilier C. Abstraction and approximate decision theoretic planning. Artificial Intelligence 89 (1997) 219-283
7. Fan M., Stallaert J., and Whinston A.B. Decentralized mechanism design for supply chain organizations using an auction market. Information Systems Research 14 1 (2003) 1-22
8. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Dordrecht, The Netherlands
9. Hoos H.H., and Boutilier C. Solving combinatorial auctions using stochastic local search. The Proceedings of the Seventeenth National Conference on Artificial Intelligence, Austin, TX (2000) 22-29
10. Ledyard J.O., Olson M., Porter D., Swanson J.A., and Torma D.P. The first use of a combined-value auction for transportation services. Interfaces 32 5 (2002) 4-12
11. Leyton-Brown K., Pearson M., and Shoham Y. Towards a universal test suite for combinatorial auction algorithms. The Proceedings of the Second ACM Conference on Electronic Commerce, Minneapolis, MN (2000) 66-76
12. Mas-Colell A., Whinston M.D., and Green J.R. Microeconomic Theory (1995), Oxford University Press, New York
13. McKay K., Pinedo M., and Webster S. Practice-focused research issues for scheduling systems. Production and Operations Management 11 2 (2002) 249-258
14. Niño-Mora J. Stochastic scheduling. In: Floudas C.A., and Pardalos P.M. (Eds). Encyclopedia of Optimization (2001), Kluwer Academic Publishers, Dordrecht, The Netherlands 367-372
15. Parkes D.C. iBundle: an efficient ascending price bundle auction. The Proceedings of the ACM Conference on Electronic Commerce (EC-99) (2000) 148-157
16. Parkes D.C., and Ungar L.H. An auction-based method for decentralized train scheduling. The Proceedings of the 5th International Conference on Autonomous Agents, Montreal (May 28-June 01 2001)
17. Pirlot M. General local search methods. European Journal of Operational Research 92 3 (1996) 493-511
18. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994), John Wiley & Sons, New York
19. Rassenti S.J., Smith V.L., and Bulfin R.L. A combinatorial auction mechanism for airport time slot allocation. Bell Journal of Economics 13 (1982) 402-417
20. Rosenschein J.S., and Zlotkin G. Rules of Encounter: Designing Conventions for Automated Negotiation Among Computers (1994), MIT Press, Cambridge, MA
21. Rothkopf M.H., Pekec A., and Harstad R.M. Computationally manageable combinational auctions. Management Science 44 8 (1998) 1131-1147
22. Russell S., and Norvig P. Artificial Intelligence: A Modern Approach (1995), Prentice-Hall, Englewood Cliffs, NJ
23. Sandholm T.W. Contract types for satisficing task allocation: I theoretical results. The Proceedings of the AAAI 1998 Spring Symposium: Satisficing Models, Stanford, CA (March 23-25 1998)
24. Sandholm T.W., and Suri S. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. The Proceedings of the National Conference on Artificial Intelligence (AAAI), Austin, TX (July 31-August 2 2000) 90-97
25. Thomas P., Teneketzis D., and MacKie-Mason J.K. A market-based approach to optimal resource allocation in integrated-services connection-oriented networks. Operations Research 50 4 (2002) 603-616
26. Walsh W.E.W., Wellman M.P., Wurman P.R., and MacKie-Mason J.K. Some economics of market-based distributed scheduling. The Proceedings of the 18th International Conference on Distributed Computing Systems (1998) 612-621
27. Wellman M.P., and Walsh W.E. Auction protocols for decentralized scheduling. Games and Economic Behavior 35 (2001) 271-303
28. Zurel E., and Nisan N. An efficient approximate allocation algorithm for combinatorial auctions. The Proceedings of the Third ACM Conference on Electronic Commerce, Tampa, FL (2001) 125-136