Dynamic pricing and automated resource allocation for complex information services: Reinforcement learning and combinatorial auctions

Lecture Notes in Economics and Mathematical Systems

Volumn 589, Issue , 2007, Pages 1-307

  Schwind, Michael ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 37249027990     PISSN: 00758442     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (411)

1. Abramson, D., Buyya, R,. & Giddy, J. (2002), 'A computational economy for grid computing and its implementation in the nimrod-g resource broker', Future Generation Computer Systems 18(8).
2. Alstrup, J., Boas, S., Madsen, O. & Vidal, R. (1986), 'Booking policy for flights with two types of passengers', European Journal of Operational Research 27, 274-288.
3. Altman, E., Boulogne, T., El-Azouzi, R., Jimenez, T. & Wynter, L. (2004), 'A survey on networking games in telecommunications', Computers and Operations Research .
4. Andersen, E. S. (1991), The core of schumpeter's work, Technical Report IKE Working Paper no. 68, Institute of Production, Aalborg University.
5. Andersen, E. S. (2004), From schumpeter's failed econometrics to modern evometric analysis: Creative destruction as a tale of two effects, in 'Proceedings of the Conference of the International Schumpeter Society', Milan.
6. Andersson, A., Tenhunen, M. &Ygge, F. (2000), Integer programming for combinatorial auction winner determination, in 'Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS '00), Boston, MA', pp. 39-46.
7. Andersson, M. R. & Sandholm, T. (1998), Leveled commitment contracting among myopic individually rational agents, in 'Proceedings of the 3rd International Conference on Multi-Agent Systems', pp. 26-33.
8. Arrow, K. J. & Debreu, G. (1954), 'Existence for a competitive equilibrium for a competitive economy', Econometrica 22(3), 265-290.
9. Arthur, B. W. (1994), 'Inductive reasoning and bounded rationality: (the el farol problem)', American Economic Review 84(2), 406-411.
10. Ausubel, L. M., Cramton, P. & Milgrom, P. (2005), The clock-proxy auction: A practical combinatorial auction design, in Y. Shoham, P. Cramton & R. Steinberg, eds, 'Combinatorial Auctions', MIT Press.
11. Ausubel, L. M. & Milgrom, P. (2002), 'Ascending auctions with package bidding', Frontiers of Theoretical Economics 1(1), 1-42.
12. Ausubel, L. M. & Milgrom, P. (2005), The lovely but lonely vickrey auction, in Y. Shoham, P. Cramton & R. Steinberg, eds, 'Combinatorial Auctions', MIT Press.
13. AuYoung, A., Chun, B. N., Snoeren, A. C. & Vahdat, A. (2004), Resource allocation in federated distributed computing infrastructures, in 'Proceedings of the 1st Workshop on Operating System and Architectural Support for the On-demand IT InfraStructure, San Francisco, USA'.
14. Axelrod, R. (1987), The evolution of strategies in the iterated prisoner's dilemma, in L. Davis, ed., 'Genetic Algorithms and Simulated Annealing', Morgan Kaufman, pp. 32-41.
15. Axelrod, R. & Hamilton, W. D. (1981), 'The evolution of cooperation', Science 211.
16. Axtell, R. L. (1999), The complexity of exchange, Technical report, The Center on Social and Economic Dynamics, Brookings Institution.
17. Ball, M., Donohue, G. & Hoffman, K. (2006), Auctions for the save, efficient and equitable allocation of airspace system resources, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT-Press.
18. Banks, J. S., Ledyard, J. & Porter, D. (1989), 'Allocating uncertain and unresponsive resources: An experimental approach', The RAND Journal of Economics 20(1), 1-25.
19. Bao, S. & Wurman, P. R. (2003), A comparison of two algorithms for multi-unit k-double auctions, in 'Proceedings of the Fifth International Conference on Electronic Commerce (ICEC-03), Pittsburgh'.
20. Barr, R., Golden, B. L., Kelly, J. P., Resende, M. & Stewart, W. (1995), 'Designing and reporting on computational experiments with heuristic methods', Journal of Heuristics 1(1), 9-32.
21. Bean, J. C. (1992), Genetics and random keys for sequencing and optimization, Technical Report 92-43, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
22. Bean, J. C. (1994), 'Genetic algorithms and random keys for sequencing and optimization', ORSA Journal on Computing 6(2), 154-160.
23. Bellman, R,. E. (1957), Dynamic Programming, Princeton University Press, Princeton, NJ.
24. Belobaba, P. P. (1987), Air Travel Demand and Airline Seat Inventory Management, PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
25. Belobaba, P. P. (1989), 'Application of a probabilistic decision model to airline seat inventory control', Operations Research 37(2), 183-197.
26. Benoist, T., Bourreau, E., Caseau, Y. & Rottembourg, B. (2001), Towards stochastic constraint programming: A study of online multi-choice knapsack with dead-lines, in 'Proceedings of the Seventh Conference on Principles and Practice of Constraint Programming - CP 2001', Vol. 2239 of Lecture Notes in Computer Science, Springer, Paphos, Cyprus, pp. 61-76.
27. Bergen, M., Ritson, M., Dutta, S., Levy, D. & Zbaracki, M. (2003), 'Shattering the myth of costless price changes: A framework for dynamic pricing', European Management Journal 21(6), 663-669.
28. Bergenti, F. & Poggi, A. (2000), Exploiting UML in the design of multi-agent systems, in A. Omicini, R. Tolksdorf & F. Zambonelli, eds, 'Engineering Societies in the Agent World, First International Workshop (ESAW 2000), Berlin, Germany, Revised Papers', Vol. 1972 of Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, pp. 106-113.
29. Bernhardt, M. & Hinz, O. (2005), Creating value with interactive pricing mechanisms a web service-oriented architecture, in '7th International IEEE Conference on E-Commerce Technology 2005, München, Germany'.
30. Bertsch, L. (1990), Expertengestützte Dienstleistungskostenrechnung, Poeschel, Stuttgart, Germany.
31. Bertsekas, D. & Tsitsiklis, J. (1996), Neuro-Dynamic Programming, Athena Scientific, Belmont, MA.
32. Bertsimas, D. & Popescu, I. (2000), 'Revenue management in a dynamic network environment', submitted to Transportation Science.
33. Bichler, M., Kalagnanam, J., Katircioglu, K., King, A. J., Lawrence, R. D., Lee, H. S., Lin, G. Y. & Lu, Y. (2002), 'Applications of flexible pricing in business-to-business electronic commerce', IBM Systems Journal 2.
34. Bichler, M., Kersten, G. E. & Strecker, S. (2003), 'Towards a structured design of electronic negotiations', Group Decision and Negotiation 12(4), 311-335.
35. Bichler, M., Pikovsky, A. & Setzer, T. (2005), 'Kombinatorische Auktionen in der betrieblichen Beschaffung - Eine Analyse grundlegender Entwurfsprobleme', Wirtschaftsinformatik 2.
36. Bichler, M. & Werthner, H. (2000), e-commerce: from fixed to dynamic pricing, Technical report, Department of Information Systems, Vienna University of Economics and Business Administration.
37. Bikhchandani, S. & Mamer, J. (1997), 'Competitive equilibrium in an exchange economy with indivisibilities', Journal of Economic Theory 74(2), 385-413.
38. Bikhchandani, S. & Ostroy, J. M. (2002), 'The package assignment model', Journal of Economic Theory 107, 377-406.
39. Bikhchandani, S. & Ostroy, J. M. (2005), From the assignment model to combinatorial auctions, in 'Combinatorial Auctions', MIT Press.
40. Bishop, C. M. (1995), Neural Networks for Pattern Recognition, Oxford University Press, Oxford, England.
41. Bitran, G. R. & Gilbert, S. M. (1996), 'Managing hotel reservations with uncertain arrivals', Operations Research 44(1), 35-49.
42. Bitran, G. R. & ;Mondschein, S. V. (1995), 'An application of yield management to the hotel industry considering multiple day stays', Operations Research 43(3), 427-443.
43. Bjørndal, M. & Jørnsten, K. (2001), An analysis of a combinatorial auction, Technical Report 2001-11, Department of Finance and Management Science, Norwegian School of Economics and Business Administration, Bergen, Norway.
44. Bossaerts, P., Fine, L. & Ledyard, J. (2002), 'Inducing liquidity in thin financial markets through combined-value trading mechanisms', European Economics Review 46(9), 1671-1695.
45. Boutilier, C. & Goldszmidt, M. (1999), Continuous value functions approximation for sequential bidding policies, in 'Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), Stockholm', pp. 81-90.
46. Boyan, J. & Moore, A. (1998), Learning evaluation functions for global optimization and boolean satisfiability, in 'Proceedings of the Fifteenth National Conference on Artificial Intelligence', pp. 3-10.
47. Boyan, J. & Moore, A. (2000), 'Learning evaluation functions to improve optimization by local search', Journal of Machine Learning Research 10, 77-112.
48. Brauer, W. & Weiss, G. (1998), Multi-machine scheduling - a multi-agent learning approach, in 'In Proceedings of the 3rd International Conference on Multi-Agent Systems', pp. 42-48.
49. Bredin, J., Maheswaran, R. T., Imer, C., Basar, T., Kotz, D. & Rus, D. (2000), A game-theoretic formulation of multi-agent resource allocation, in 'Proceedings of the 4th International Conference on Autonomous Agents', Barcelona,, Spain, pp. 349-356.
50. Bronstein, I. N., Semendjajew, K. A., Musiol, G. & Mühlig, H. (2001), Taschenbuch der Mathematik, 5 edn, Verlag Harri Deutsch, Thun und Frankfurt/Main.
51. Brouwer, L. E. J. (1912), 'Über abbildung von mannigfaltigkeiten', Mathematische Annalen 71, 97-115.
52. Brunelle, J., Hurst, P., Huth, J., Kang, L., Ng, C., Parkes, D. C., Seltzer, M., Shank, J. & Youssef, S. (2006), Egg: An extensible and economics-inspired open grid computing platform, in 'Proceedings of the 3rd International Workshop on Grid Economics and Business Models (GECON 2006), Singapore'.
53. Bry, F. (1989), Logic programming as constructivism: A formalization and its application to databases, in 'Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania', ACM Press, pp. 34-50.
54. Brynjolfsson, E. (1993), 'The productivity paradox of information technology', Communications of the ACM 36(12), 66-77.
55. Brynjolfsson, E. & Smith, M. (2000), 'Frictionless commerce? a comparison of internet and conventional retailers', Management Science 46(4), 563-585.
56. Bubendorfer, K. & Hine, J. (2005), Auction based resource negotiation in nomad, in 'Twenty-Eighth Australasian Computer Science Conference (ACSC2005), Newcastle, Australia. CRPIT, 38', pp. 297-306.
57. Buhmann, J. M. & Hofmann, T. (1996), An annealed neural gas network for robust vector quantization, in 'Proceedings of the International Conference on Artificial Neural Networks (ICANN96)', pp. 151-156.
58. Buyya, R., Giddy, J. & Abramson, D. (2000), An evaluation of economy-based resource trading and scheduling on computational power grids for parameter sweep applications, in 'Proceedings of the 2nd International Workshop on Active Middleware', Kluwer Academic Press, Pittsburgh.
59. Buyya, R., Stockinger, H., Giddy, J. & Abramson, D. (2001), Economic models for management of resources in peer-to-peer and grid computing, in 'Proceedings of the SPIE International Conference on Commercial Applications for High-Performance Computing', Denver, USA.
60. Buyya, R., & Vazhkudai, S. (2001), Compute power market: Towards a market-oriented grid, in 'Proceedings of 1st IEEE International Conference on Cluster Computing and the Grid'.
61. Bykowsky, M. M., Cull, R. J. & Ledyard, J. (1995), 'Mutually destructive bidding: The fee auction design problem', Journal of Regulatory Economics 17(3), 205-228.
62. Cantillon, E. & Pesendorfer, M. (2006), Auctioning bus routes, in P. Cramton, Y. Shoham & R. Steinberg, eds, 'Combinatorial Auctions', MIT-Press.
63. Cao, X.-R., Shen, H.-X., Milito, R. & Wirth, P. (2002), 'Internet pricing with a game theoretical approach: concepts and examples', IEEE ACM Transactions Networks 10(2), 208-216.
64. Capuce, C. (1996), An Optimization Based Bidding Process: A New Framework for Shipper-Carrier Relationships, PhD thesis, Massachusetts Institute of Technology.
65. Carvalho, A. X. & Puterman, M. L. (2005), 'Learning and pricing in an internet environment with binomial demands', Journal of Revenue and Pricing Management 3(4), 320-336.
66. Casavant, T. & Kuhl, J. (1988), 'A taxonomy of scheduling in general-purpose distributed computing systems', IEEE Transactions on Software Engineering 14(2), 141-154.
67. Catoni, O. (1998), 'Solving scheduling problems by simulated annealing', SIAM Journal on Control and Optimization 36(5), 1539-1575.
68. Challet, D. & Zhang, Y.-C. (1997), 'Emergence of cooperation and organization in an evolutionary game', Physica A 246(407).
69. Chandra, V. & Rao, M. R. (1998), Integer programming, Technical Report T.R..No. IISc-98-04, Department of Computer Science and Automotion, Indian Institute of Science, Bangalore, India.
70. Chang, S. S. (1998), A survey on reinforcement learning in global optimization, Technical report, Computer Science Department of the University of Berkeley, Berkeley, CA.
71. Chang, X. & Subramanian, K. R. (2000), A cooperative game theory approach to resource allocation in wireless atm network, in 'Proceedings of Broadband Communications, High Performance Networking, and Performance of Communication Networks, IFIP-TC6, Networking 2000', Vol. 1815 of Lecture Notes in Computer Science, Springer, Berlin, pp. 969-978.
72. Chavez, A. & Maes, P. (1996), Kasbah: An agent marketplace for buying and selling goods, in 'Proceedings of the first International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM)', Practical Application Company, London, UK, pp. 75-90.
73. Chen, V. C., Günther, D. & Johnson, E. L. (1999), 'Airline yield management: Optimal bid prices for single hub problems without cancellations', submitted to Journal of Transportation Science.
74. Cheng, J. & Wellman, M. (1996), 'The WALRAS algorithm: A convergent distributed implementation of general-equilibrium outcomes', Computational Economics 12.
75. Chernev, A. (2003), 'Reverse pricing and online price elicitation strategies in consumer choice', Journal of Consumer Psychology 13(1&2), 51-62.
76. Chevaleyre, Y., Endriss, U., Lang, J. & Maudet, N. (2005), Negotiating over small bundles of resources, in 'Proceedings of the 4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS-2005)', ACM Press.
77. Chu, P. C. & Beasley, J. E. (1995), A genetic algorithm for the set partitioning problem, Technical report, The Management School Imperial College London.
78. Chun, B. N., Buonadonna, P., AuYoung, A., Ng, C., Parkes, D. C., Shneiderman, J., Snoeren, A. C. & Vahdat, A. (2004), Mirage: A microeconomic resource allocation system for sensornet testbeds, in 'Proceedings of the 2nd IEEE Workshop on Embedded Networked Sensors (EmNetS-II); Sidney, Australia'.
79. Chun, B. N. & Culler, D. E. (2000), Market-based proportional resource sharing for clusters, Technical Report CSD-1092, University of California at Berkeley, Computer Science Division.
80. Chun, B. N. & Culler, D. E. (2002), User-centric performance analysis of marketbased cluster batch schedulers, in 'Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid, Berlin, Germany', pp. 30-38.
81. Clarke, E. (1971), 'Multipart pricing of public goods', Public Choice Journal 11, 17-33.
82. Clearwater, S. H. (1996), Market-Based Control: A Paradigm for Distributed Resource Allocation, World Scientific, Singapore.
83. Cole, R., Dodis, Y. & Roughgarden, T. (2003), Pricing networks with selfish routing, in 'Workshop on Economics of Peer-to-Peer Systems'.
84. Collins, J., Gini, M. & Mobasher, B. (2002), Multi-agent negotiation using combinatorial auctions with precedence constraints, Technical Report T.R.No. 02-009, University of Minnesota, Department of Computer Science and Engineering, Minneapolis, MN.
85. Collins, J., Tsvetovat, M., Mobasher, B. & Gini, M. (1998), MAGNET: A multiagent contracting system for plan execution, in 'Proceedings of Workshop on Artificial Intelligence and Manufacturing: State of the Art and State of Practice', AAAI Press, pp. 63-68.
86. Conen, W. (2003), Economically-augmented job shop scheduling, in E. Giunchiglia, N. Muscettola & D. Nau, eds, 'International Conference on Automated Planning Sz. Scheduling (ICAPS)', AAAI Press, Trento, Italy.
87. Conen, W. & Sandholm, T. (2001), Minimal preference elicitation in combinatorial auctions, in 'IJCAI Workshop on Economic Agents, Models, and Mechanisms, Seattle, August 2001'.
88. Conen, W. & Sandholm, T. (2002), Coherent pricing of efficient allocations in combinatorial economies, in 'AAAI Workshop Technical Report WA-02-06 of the AAAI 2002 Workshop on Game Theoretic and Decision Theoretic Agents (GTDT'02), Edmonton, Canada'.
89. Correa, J., Schulz, A. S. Sz, Moses, N. S. (2004), 'Selfish routing in capacitated networks', Mathematics of Operations Research 29(4), 961-976.
90. Costa, N. D. & Doria, F. A. (2005), Computing the future, in V. Velupillai, ed., 'Computability, Compexity and Constuctivity in Economic Analysis', Blackwell, Malden, pp. 15-50.
91. Cramton, P. (2005), Simulaneous ascending auctions, in P. Cramton, Y. Shoham & R. Steinberg, eds, 'Combinatorial Auctions', MIT Press, chapter 4.
92. Cramton, P., Shoham, Y. & Steinberg, R. (2005), Combinatorial auctions: Introduction, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT Press.
93. Dantzig, G. B. & Thapa, M. N. (1997), Linear Programming: Introduction, Springer Series in Operations Research and Financial Engineering, Springer Verlag, Berlin.
94. Davenport, A. J. & Kalagnanam, J. (2001), Price negotiations for procurement of direct inputs, Technical Report IBM Technical Report RC 22078, IBM T. J. Watson Research Center, Yorktown Heights, New York.
95. Davis, R. & Smith, R. G. (1983), 'Negotiation as a metaphor for distributed problem solving', Artificial Intelligence 20, 63-109.
96. Debreu, G. (1959), Theory of Value, John Wiley and Sons, New York, NY.
97. Deng, X., Papadimitriou, C. H. & Safra, S. (2002), On the complexity of equilibria, in 'Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002, Montréal, Québec, Canada', pp. 67-71.
98. Doerninger, W. (1984), 'Approximating general markovian decision problems by clustering their state- and action-spaces', Math. Operationsforschung und Statistik: Ser. Optimization 14, 135-144.
99. Dooley, K. (2005), 'Complex adaptive systems : A nominal definition', http://www.eas.asu.edu/kdooley/casopdef.html. accessed 1.7.2005.
100. Drexler, K. E. & Miller, M. S. (1988), Incentive engineering: for computational resource management, in B. A. Huberman, ed., 'The Ecology of Computation', Elsevier Science Publishers, North-Holland, pp. 231-266.
101. Durfee, E. H. (1999), Distributed problem solving and planning, in 'Multiagent Systems', The MIT Press, Cambrige, MA.
102. Dziong, Z. & Mason, L. G. (1996), 'Fair-efficient call admission control policies for broadband networks: A game theoretic framework', IEEE ACM Transactions Networks 4(1), 123-136.
103. Easwaran, A. & Pitt, J. (2000), A brokering algorithm for cost & QoS-based winner determination in combinatorial auctions, in R. Loganantharaj & G. Palm, eds, 'Intelligent Problem Solving, Methodologies and Approaches, 13th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems (IEA/AIE 2000), New Orleans, LU', Vol. 1821 of Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany.
104. Elendner, T. (2003), Scheduling and combinatorial auctions: Lagrangean relaxation-based bounds for the wjisp, Technical Report 570, Manuskripte aus den Instituten für Betriebswirtschaftslehre, Christian-Albrechts- Universität zu Kiel.
105. Elendner, T. (2004), Winner Determination in Combinatorial Auctions: Market-based Scheduling, Logos, Berlin.
106. Elmaghraby, W. & Keskinocak, P. (2003), 'Dynamic pricing: Research overview, current practices and future directions', Management Science 49(10), 1288.
107. Epstein, R., Lysette, H., Catalan, J., Weintraub, G. & Martinez, C. (2002), 'A combinatorial auction improves school meals in chile', Interfaces 32(6), 1-14.
108. Ernemann, C., Hamscher, V. & YahYapour, R. (2002), Economic scheduling in grid computing, in 'Job Scheduling Strategies for Parallel Processing, 8th International Workshop, JSSPP 2002, Edinburgh, Scotland', Lecture Notes in Computer Science, Springer Verlag.
109. Eymann, T. (2001), Co-evolution of bargaining strategies in a decentralized multiagent system, in 'Proceedings of the AAAI Fall 2001 Symposium on Negotiation Methods for Autonomous Cooperative Systems, North Falmouth, MA, November 03-04'.
110. Eymann, T., Reinicke, M., Ardaiz, O., Artigas, P., Cerio, Freitag, F., Messeguer, R., Navarro, L. &: Royo, D. (2003), Decentralized vs. centralized economic coordination of resource allocation in grids, in 'Proceedings of the 1. European Across Grids Conference'.
111. Fagerberg, J. (2003), 'Schumpeter and the revival of evolutionary economics: an appraisal of the literature', Journal of Evolutionary Economics 13, 125-159.
112. Fan, M., Stallaert, J. & Whinston, A. (2001), 'Decentralized mechanism design for supply chain organizations using an auction market', Information Systems Research .
113. Fang, Z. & Bensaou, B. (2004), Fair bandwidth sharing algorithms based on game theory frameworks, in 'Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, China', IEEE.
114. Feldman, M., Lai, K., Stoica, I. & Chuang, J. C.-I. (2004), Robust incentive techniques for peer-to-peer networks, in 'Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA', ACM, pp. 102-111.
115. Feldman, M., Lai, K. & Zhang, L. (2005), A price-anticipating resource allocation mechanism for distributed shared clusters, in 'Proceedings of the ACM Conference on Electronic Commerce'.
116. Ferguson, D. (1989), The Application of Microeconomics to the Design of Resource Allocation and Control Algorithms, PhD thesis, Columbia University.
117. Ferguson, D., Nikolaou, C., Sairamesh, J. & Yemini, Y. (1996), Economic models for allocating resources in computer systems, in S. H. Clearwater, ed., 'Market- Based Control: A Paradigm for Distributed Resource Allocation', World Scientific, Singapore.
118. FIPA (2000o), 'FIPA ACL message structure specification', http://www.fipa.org/specifications/fipa00061. accessed 15.6.2005.
119. FIPA (20006), 'FIPA contract net interaction protocol specification', http://www.fipa.org/specifications/fipa00029. accessed 15.6.2005.
120. FIPA (2000c), 'FIPA KIF content language specification', http://www.fipa.org/specifications/fipa00010. accessed 15.6.2005.
121. FIPA (200Od), 'FIPA ontology service specification', http://www.fipa.org/ specifications/fipa00086. accessed 15.6.2005.
122. Fisher, M. L. (1981), 'The lagrangian relaxation method for solving integer programming problems', Management Science 27(1), 1-18.
123. Fisher, M. & Wolsey, L. (1982), 'On the greedy heuristic for continuous covering and packing problems', SIAM Journal on Algebraic and Discrete Methods 3, 584591.
124. Foster, I., Jennings, N. R. & Kesselman, C. (2004), Brain meets brawn: Why grid and agents need each other, in 'Proceedings of the 3rd International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS04)', New York, NY, pp. 8-15.
125. Foster, I., Kesselman, C. & Tuecke, S. (2001), 'The anatomy of the grid: Enabling scalable virtual organizations', Lecture Notes in Computer Science 2150.
126. Fritzke, B. (1995), A growing neural gas network learns topologies, in G. Tesauro, D. Touretzky & T. Leen, eds, 'Advances in Neural Information Processing Systems', Vol. 7, MIT Press.
127. Fujishima, Y., Leyton-Brown, K. & Shoham, Y. (1999), Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches, in 'Proceedings of the 16th International Joint Conference on Artificial Intelligence 1999 (IJCAI-99), Stockholm, Sweden', pp. 548 - 553.
128. Galstyan, A., Shashikiran, K. & Lerman, K. (2003), Resource allocation games with changing resource capacities, in 'AAMAS '03: Proceedings of the second international joint conference on Autonomous agents and multiagent systems, Melbourne, Australia', ACM Press, pp. 145-152.
129. Ganesh, A., Laevens, K. & Steinberg, R. (2001), Congestion pricing and user adaptation, in 'Proceedings of the IEEE Infocom 2001, the Annual Joint Conference of the IEEE Computer and Communications Societies (20th), 22-26 April 2001, Anchorage, Alaska', pp. 959-965.
130. Garey, M. R., Johnson, D. S. & Sethi, R. (1976), 'The complexity of flow shop and job shop scheduling', Math. Operations Research 1, 117-129.
131. Garfinkel, R. & Nemhauser, G. (1969), 'The set partitioning problem: Set covering problem with equality constraints', Operations Research 17(5), 848-856.
132. Genesereth, M. R. (1998), 'Knowledge interchange format: Draft proposed american national standard'. NCITS.T2/98-004.
133. Ghose, A., Choudhary, V., Mukhopadhyay, T. & Rajan, U. (2002), 'Electronic commerce and competitive first-degree price discriminators', Review of Marketing Science. Working Papers 2(1).
134. Giovanucci, A., Rodriguez-Aguilar, J., Cerquides, J., Reyes-Moro, A. & Noria, F. (2004), ibundler: an agent-based decision support service for combinatorial negotiations, in 'roceedings of the Nineteenth National Conference on Artificial Intelligence, Sixteenth Conference on Innovative Applications of Artificial Intelligence, 2004, San Jose, California, USA', pp. 1012-1013.
135. Goldberg, D. E. (1989a), Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA.
136. Goldberg, D. E. (19896), Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA.
137. Gomory, R. E. (1958), 'Outline of an algorithm for integer solutions to linear programs', Bulletin of the American Mathematical Society 64, 275-278.
138. Gonen, R. & Lehmann, D. (2001), Linear programming helps solving large multi-unit combinatorial auctions, in 'Proceedings of the INFORMS Electronic Market Design Workshop 2001'.
139. Gosavi, A. (2004), 'A reinforcement learning algorithm based on policy iteration for average reward: Empirical results with yield management and convergence analysis', Machine Learning 55(1), 5-29.
140. Gosavi, A., Bandla, N. & Das, T. K. (2002), 'A reinforcement learning appoach to airline seat allocation for multiple fare classes with overbooking', HE Transactions, Special Issue on Advances on Large-Scale Optimization for Logistics, Production and Manufacturing systems 34(9), 729-742.
141. Groves, T. (1973), 'Incentive in teams', Econometrica 41(4), 617-631.
142. Gruber, T. (1995), 'Toward principles for the design of ontologies used for knowledge sharing', International Journal of Human Computer Studies 43(5/6), 907928.
143. Guarino, N. (1995), 'Formal ontology, conceptual analysis and knowledge representation', International Journal of Human Computer Studies.
144. Gupta, A., Stahl, D. O. &: Whinston, A. B. (1997), Priority pricing of integrated services networks, in J. Bailey & L. McKnight, eds, 'Internet Economies', MIT Press, Cambridge, pp. 323-352.
145. Gupta, A., Stahl, D. O. & Whinston, A. B. (1999), 'The economics of network management', Communications of the ACM 42(9), 57-63.
146. Halblau, V. (2002), 'Algorithmische Konzepte in kombinatorischen Auktionen'. Diploma thesis, Frankfurt University, Institute for Information Systems.
147. Hardin, G. (1968), 'The tragedy of the commons', Science 162(3859), 1243-1248.
148. Hart, P. E., Nilsson, N. J. & Raphael, B. (1968), 'A formal basis for the heuristic determination of minimum cost paths', IEEE Transactions on Systems Science and Cybernetics 4, 100-107.
149. Hartung, J., Elpelt, B. & Klösener, K.-H. (1999), Statistik: Lehr- und Handbuch der angewandten Statistik, 12 edn, Oldenbourg Verlag, München, Wien.
150. Hayek, F. A. (1976a), Die Verwertung des Wissens in der Gesellschaft, in F. A. Hayek, ed., 'Individualismus und Wirtschaftliche Ordnung', Wolfgang Neugebauer, Salzburg, Austria.
151. Hayek, F. A. (1976b), Law Legislation and Liberty, Chicago University Press, Chicago, Illinois.
152. Hayek, F. A. (1996a), Der Wettbewerb als Entdeckungsverfahren, in F. A. Hayek, ed., 'Von Hayek bis White', MANZ Verlag, Vienna, Austria. First published in: Leube, K. R-(Ed.): The International Library of Austrian Economics (1968).
153. Hayek, F. A. (19966), Die Verhängnisvolle Anmassung: Die Irrtümer des Sozialismus, Mohr Siebeck, Tübingen, Germany.
154. Hein, O., Schwind, M. & König, W. (2006), 'Scale-free networks - the impact of fat tailed degree distribution on diffusion and communication networks', Wirtschaftsinformatik 48(4), 267-275.
155. Hein, O., Schwind, M. & Spiwoks, M. (2005), A microscopic stock market model with heterogeneous interacting agents in a scale-free communication network, in '10th Annual Workshop on Economic Heterogeneous Interacting Agents (WEHIA 2005), Essex, UK'.
156. Hildenbrand, A. P. & Kirman, W. (1976), Introduction to Equilibrium Analysis, North Holland, Amsterdam, The Netherlands.
157. Hirsch, M. D. & Papadimitriou, C. H. (1989), 'Exponential lower bounds for finding brouwer fixed points', Journal of Complexity 5(4), 379-416.
158. Hohner, G., Rich, J., Ng, E., Reid, G., Davenport, A. J., Kalagnanam, J., Lee, H. S. & Chae, A. (2003), 'Combinatorial and quantity-discount procurement auctions benefit mars, incorporated and its suppliers', Interfaces 33(1), 23-35.
159. Holland, J. H. (1975), Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence, University of Michigan Press, Ann Arbor, MI.
160. Holland, J. H. (1998), Emergence: From Chaos to Order, Addison-Wesley, Redwood, CA.
161. Holland, J. & Miller, J. H. (1991), 'Artificial adaptive agents in economic theory', American Economic Review 81(2), 365-370.
162. Hoos, H. H. & Boutilier, C. (2000), Solving combinatorial auctions using stochastic local search, in 'Proceedings of the 17th National Conference on Artificial Intelligence (IAAI), Austin, TX', AAAI, pp. 22-29.
163. Hoppmann, E. (1993), Unwissenheit, Wirtschaftsordnung und Staatsgewalt, Haufe Verlag, Freiburg, Germany.
164. Hornick, S. (1991), Value based revenue management - a new paradigm for airline seat inventory control, in 'Advanced Software Technology in Air Transport', AIT-Verlag, Hallbergmoos, Germany.
165. Hu, J. (1999), Learning in Dynamic Noncooperative Multiagent Systems, PhD thesis, University of Michigan, Ann Arbor.
166. Hu, J. & Wellman, M. P. (1998), Multiagent reinforcement learning: Theoretical framework and an algorithm, in 'Proceedings of the Fifteenth International Conference on Machine Learning, (ICML 1998), Madison, Wisconsin', Morgan Kaufmann, pp. 24-27.
167. Hu, J. & Wellman, M. P. (2003), 'Nash q-learning for general-sum stochastic games', Journal of Machine Learning Research 4, 1039-1069.
168. Hu, J. & Zhang, Y. (2002), Online reinforcement learning in multiagent systems, Technical report, William E. Simon Graduate School of Business Administration, University of Rochester, New York.
169. Huberman, B. A. & Wu, F. (2002), The dynamics of reputations, Technical report, Hewlett-Packard Laboratories and Stanford University.
170. Hudson, B. & Sandholm, T. (2002), Effectiveness of preference elicitation in combinatorial auctions, in 'Proceedings of the Agent-Mediated Electronic Commerce (AMEC) workshop at AAMAS-02, Bologna, Italy'.
171. Hudson, B. & Sandholm, T. (2004), Effectiveness of query types and policies for preference elicitation in combinatorial auctions, in 'In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), New York', pp. 386-393.
172. Huhns, M. N. & Stephens, L. M. (1999), Multiagent systems and societies of agents, in G. Weiss, ed., 'Multiagent Systems', MIT Press, Massachusetts, chapter 2, pp. 79-120.
173. Hultgren, G. & Eriksson, O. (2003), The notion of it-services from a social interaction perspective, in 'Proceedings of the Conference for the Promotion of Research in IT at New Universities and University Colleges in Sweden, Promote IT, Gotland'.
174. Humair, S. (2001), Yield Management for Telecommunication Networks: Defining a New Landscape, PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
175. Il-Horn, H. & Terwiesch, C. (2003), 'Measuring the frictional costs of online transactions: The case of name-your-own-price channel', Management Science 49(11), 1563-1579.
176. Jennings, N. R., Faratin, P., Lomuscio, A. R., Parsons, S., Sierra, C. & Wooldridge, M. (2001), 'Automated negotiation: Prospects, methods and challenges', Journal of Group Decision and Negotiation 10(2), 199-215.
177. Judd, K. L. (2002), Solving dynamic stochastic competitive general equilibrium models, Technical report, Hoover Institution, Stanford University.
178. Kaelbling, L., Brandt, F., Bauer, W. & Weiss, G. (2000), Task assignment in multiagent systems based on vickrey-type auctioning and leveled commitment contracting, in 'Proceedings of the Fourth International Workshop on Cooperative Information Systems (CIA)', Vol. 1860 of Lecture Notes in Computer Science, Springer Verlag, Berlin, pp. 95-106.
179. Kaelbling, L., Littman, M. & Moore, A. (1996), 'Reinforcement learning: A survey', Journal of Artificial Intelligence Research 4, 237-285.
180. Kakutani, S. (1941), 'A generalization of brouwer's fixed point theorem', Duke Mathematical Journal 8, 457-459.
181. Kalagnanam, J. & Parkes, D. C. (2003), Auctions, bidding and exchange
182. Kauffman, R. J. & Lee, D. (2004), Price rigidity on the internet: New evidence from the online bookselling industry, in 'Proceedings of the 25th International Conference on Information Systems (ICIS 2004), Washington, DC, December 2004'.
183. Kauffman, R. J. & Wang, B. (2001), New buyers arrival under dynamic pricing market microstructure: The case of group-buying discounts on the internet, in 'Proceedings of the 34th Hawaii International Conference on System Sciences 2001, Maui, Hawaii', pp. 7034-7044.
184. Kephart, J., Hanson, J. E. &: Greenwald, A. R. (2000), 'Dynamic pricing by software agents', Computer Networks 32(6), 731-752.
185. Kephart, J. & Tesauro, G. (2000), Pseudo-convergent q-learning by competitive pricebots, in P. Langley, ed., 'Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA', Morgan Kaufmann, pp. 463-470.
186. Kimes, S. (1989), 'Yield management: A tool for capacity constrained firms', Journal of Operations Management 4, 348-363.
187. Kirkpatrick, S., Jr., C. G. &: Vecchi, M. (1983), 'Optimization by simulated annealing', Science 220, 671-680.
188. Klemperer, P. (2004), Auctions: Theory and Practice, Princeton University Press.
189. Kleywegt, A. (2001), An optimal control problem of dynamic pricing, Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia.
190. Kohonen, T. (1995), Self-Organizing Maps, Springer Series in Information Sciences, Springer Verlag, Berlin.
191. König, W. & Schwind, M. (2005), Entwurf von kombinatorischen Auktionen für Allokations- und Beschaffungsprozesse, in B. Rieger & D. Karagiannis, eds, 'Herausforderungen der Wirtschaftsinformatik: Festschrift für Prof. Krallmann', Vol. 3, Springer Verlag, Berlin, pp. 29-45.
192. Koopmans, T. & Beckmann, M. (1957), 'Assignment problems and the location of economic activities', Econometrica 25(1), 53-76.
193. Korf, R. E. (1985), 'Depth-first iterative-deepening: an optimal admissible tree search', Artificial Intelligence 27(1), 97-109.
194. Korilis, Y. A., Lazar, A. A. & Orda, A. (1995), 'Architecting noncooperative networks', IEEE Journal on Selected Areas in Communication 13(7), 1241-1251.
195. Korilis, Y. A., Lazar, A. A. &: Orda, A. (1997), 'Capacity allocation under noncooperative routing', IEEE Transactions on Automatic Control 42(3), 309-325.
196. Kubler, F. (2005), 'Notes on Arrow-Debreu economies', http://www.vwl.unimannheim.de/kuebler/prs/cgel.pdf.
197. Kuhlen, R. (1995), Informationsmarkt - Chancen und Risiken der Kommerzialisierung von Wissen, UVK: Universitätsverlag Konstanz, Konstanz.
198. Kurose, J. & Shima, R. (1989), 'A microeconomic approach to optimal resource allocation in distributed computer systems', IEEE Transactions on Computers 38(5), 705-717.
199. Kwasnica, A. M., Ledyard, J., Porter, D. & DeMartini, C. (2005), 'A new and improved design for multi-objective iterative auctions', Management Science 51(3), 419-434.
200. Kwok, Y.-K., Song, S. & Hwang, K. (2005), Selfish grid computing: Game-theoretic modeling and nas performance results, in 'Proceedings of the International Symposium on Cluster Computing and the Grid, Cardiff, UK'.
201. Lai, K. (2005), Markets are dead, long live markets, Technical Report arXiv:cs.OS/0502027, HP Labs, Palo Alto, CA, USA.
202. Lai, K., Huberman, B. A. &: Fine, L. (2004), Tycoon: A distributed market-based resource allocation system, Technical Report arXiv:cs.DC/0404013, HP Labs, Palo Alto, CA, USA.
203. Lai, K., Rasmusson, L., Adar, E., Sorkin, S., Zhang, L. & Huberman, B. A. (2004), Tycoon: an implemention of a distributed market-based resource allocation system, Technical Report arXiv:cs.DC/0412038, HP Labs, Palo Alto, CA, USA.
204. Lawler, E. L. & Wood, E. D. (1966), 'Branch-and-bound methods: A survey', Operations Research 14(4), 699-719.
205. Ledyard, J., Olson, M., Porter, D., Swanson, J. A. & Torma, D. P. (2002), 'The first use of a combined-value auction for transportation services', Interfaces 32(5), 4-12.
206. Ledyard, J., Porter, D. & Rangel, A. (1997), 'Experiments testing multiobject allocation mechanisms', Journal of Economics & Management Strategy 6(3), 639-675.
207. Lehmann, D., Müller, R- &: Sandholm, T. (2005), The winner determination problem, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT Press.
208. Lehmann, D., O'Callaghan, L. & Shoham, Y. (1999), 'Truth revelation in approximately efficient combinatorial auctions', Journal of the A CM 49(4), 577-602.
209. Lesser, V. R. (1995), 'Multiagent systems: An emerging subdiscipline of ai', ACM Computing Surveys 27(3), 340-342.
210. Levine, D. (1994), A Parallel Genetic Algorithm for the Set Partitioning Problem, PhD thesis, Argonne National Laboratory, Argonne, IL.
211. Levy, L., Blumrosen, L. & Nisan, N. (2001), On line markets for distributed object services: the majic system, in 'Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems USITS 2001, San Francisco, CA', USENIX, pp. 85-96.
212. Leyton-Brown, K., Pearson, M. & Shoham, Y. (2000), Towards a universal test suite for combinatorial auction algorithms, in 'ACM Conference on Electronic Commerce', pp. 66-76.
213. Likhodedov, A. & Sandholm, T. (2005), Approximating revenue-maximizing combinatorial auctions, in 'Proceedings of the National Conference on Artificial Intelligence (AAAI), Pittsburgh, PA'.
214. Littman, M. (1994), Markov games as a framework for multi-agent reinforcement learning, in 'Proceedings of the Eleventh International Conference on Machine Learning, San Francisco, CA', Morgan Kaufmann, pp. 157-163.
215. MacKie-Mason, J. K., Murphy, L. & Murphy, J. (1996), The role of responsive pricing in the internet, in J. Bailey & L. McKnight, eds, 'Internet Economics', MIT Press, pp. 279-304.
216. MacKie-Mason, J. K. & Varian, H. R. (1995), 'Pricing congestible network resources', IEEE Journal on Selected Areas in Communications 13(7), 1141-1149.
217. Maes, P., Guttman, R. & Moukas, A. G. (1999), 'Agents that buy and sell', Communications of the ACM 42(3), 81-91.
218. Maheswaran, R. T. & Basar, T. (2001), Decentralized network resource allocation as a repeated noncooperative market game, in 'Proceedings of the 40th IEEE Conference on Decision and Control', Orlando, Florida, pp. 4565-4570.
219. th edn, North Holland, Amsterdam, The Netherlands.
220. Malone, T., Fikes, R. E., Grant, K. R. & Howard, M. T. (1988), Enterprise computation, in B. Huberman, ed., 'The Ecology of Computation', Elsevier Science Publishers, North-Holland, pp. 177-205.
221. Martin, B. (2004), Combinatorial aspects of yield management, a reinforcement learning approach, in 'Proceedings of The 2004 European Simulation and Modelling Conference ESM2004', Magdeburg, Germany.
222. Mas-Colell, A., Whinston, M. & Green, J. (1995), Microeconomic Theory, Oxford University Press, Oxford.
223. McAfee, P. & McMillan, J. (1987), 'Auctions and bidding', Journal of Economic Literature 25, 699-738.
224. McCarthy, J. (2004), 'What is artificial intelligence?', http://www-formal.stanford.edu/jmc/whatisai/whatisai.html. Accessed 11.5.2005.
225. McMillan, J. (1994), 'Selling spectrum rights', Journal of Economic Perspectives 8(3), 145-162.
226. McMillan, J. (1995), 'Why auction the spectrum?', Telecommunications Policy 19, 191-199.
227. Mehra, P. &: Wah, B. W. (1993), Population-based learning of load balancing policies for a distributed computer system, in 'Proceedings of the Computing in Aerospace 9 Conference Oct. 1993, San Diego, CA', American Institute of Aeronautics and Astronautics, pp. 1120-1130.
228. Mehra, P. & Wah, B. W. (1997), 'Automated learning of load-balancing strategies in multiprogrammed distributed systems', International Journal of System Sciences 28(11), 1077-1100.
229. Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H. & Teller, E. (1953), 'Equation of state calculations by fast computing machines', Journal of Chem. Phys. 21(6), 1087-1092.
230. Milgrom, P. (1989), 'Auctions and bidding: A primer', Journal of Economic Perspectives 3(3), 3-22.
231. Milgrom, P. (2000), 'Putting auction theory to work: The simultaneous ascending auction', Journal of Political Economy 108(2), 245-272.
232. Milgrom, P. (2004), Putting Auction Theory to Work, Cambridge University Press.
233. Miller, M. S. & Drexler, K. E. (1988a), Comparative ecology: A computational perspective, in B. A. Huberman, ed., 'Ecology of Computation', Elsevier Science Publishers, Amsterdam, pp. 51-76.
234. Miller, M. S. &: Drexler, K. E. (19886), Markets and computation: Agoric open systems, in B. A. Huberman, ed., 'The Ecology of Computation', Elsevier Science Publishers, North-Holland, pp. 133-176.
235. Miller, M. S., Krieger, D., Hardy, N., Hibbert, C. & Tribble, E. D. (1996), An automated auction in ATM network bandwidth, in 'Market-based control: A Paradigm for Distributed Resource Allocation', World Scientific Publishing Co., Inc., River Edge, NJ, USA, pp. 96-125.
236. Morris, J., Ree, P. & Maes, P. (2000), Sardine: Dynamic seller strategies in an auction marketplace, in 'Proceedings of the 2nd ACM Conference on Electronic Commerce (EC-00)', Minneapolis, MN, USA, pp. 128-134.
237. Mu'alem, A. &: Nisan, N. (2002), Truthful approximation mechanisms for restricted combinatorial auctions, in 'Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, Edmonton, Alberta, Canada. AAAI Press, 2002', pp. 379-384.
238. Mui, L., Mohtashemi, M. & Halberstadt, A. (2002), A computational model of trust and reputation, in 'Proceedings of the 35th Hawaii International Conference on System Science (HICSS), Big Island'.
239. Mullen, T. &: Wellman, M. P. (1995), A simple computational market for network information services, in 'Proceedings of the First International Conference on Multiagent Systems', AAAI Press / MIT Press, San Francisco, CA, pp. 283-189.
240. Mullen, T. & Wellman, M. P. (1996), Market-based negotiation for digital library services, in 'Proceedings of the Second USENIX Workshop on Electronic Commerce', Oakland, CA.
241. Nair, S. & Bapna, R. (2001), 'An application of yield management for internet providers', Naval Research Logistics 48, 348-362.
242. Narahari, Y., Raju, V. L. P. & Ravikumar, K. (2005), 'Dynamic pricing models for electronic business', Sadhana, Indian Academy of Sciences Proceedings in Engineering Sciences. Special Issue on Electronic Commerce and Electronic Business.
243. Nash, J. F. (1950), 'The bargaining problem', Econometrica 18, 155-162.
244. Neumann, D., Holtmann, C. & Orwat, C. (2006), 'Grid-economies', Wirtschaftsinformatik 48(3), 206-209.
245. Ng, C., Parkes, D. C. & Seltzer, M. (2003a), Strategyproof computing: Systems infrastructures for self-interested parties, in 'Proceedings of the 1st Workshop on the Economics of Peer-to-Peer Systems, Berkeley, CA'.
246. Ng, C., Parkes, D. C. &: Seltzer, M. (20036), Virtual worlds: Fast and strategyproof auctions for dynamic resource allocation, in 'Proceedings of the third ACM Conference on Electronic Commerce (EC-2003), San Diego, CA', ACM, pp. 238-239.
247. th edn, Duncker & Humboldt, Berlin, Germany.
248. Nisan, N. (2000), Bidding and allocation in combinatorial auctions, in 'Proceedings of the 2.nd ACM Conference on Electronic Commerce (ACM ECOO), Minneapolis, MN', ACM, pp. 1-12.
249. Nisan, N. (2005), Bidding languages, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT-Press.
250. Nisan, N., Mu'alem, A. & Lavi, R. (2003), Towards a characterization of truthful combinatorial auctions, in 'Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science 2003, Cambridge, MA, USA'.
251. Nollau, V. & Hahnewald-Busch, A. (1978), 'Approximating general markovian decision problems by clustering their state- and action-spaces', MaiA. Operationsforschung und Statistik: Ser. Optimization 9, 109-117.
252. Norman, B. A. (1995), Scheduling Using the Random Keys Genetic Algorithm, unpublished PhD thesis, University of Michigan, Ann Arbor, Michigan.
253. Norman, B. A. & Bean, J. C. (1994), Random keys genetic algorithm for job shop scheduling, Tech. Rep. No. 94-5, The University of Michigan, Ann Arbor, MI.
254. Norman, B. A. & Bean, J. C. (1997), Operation sequencing and tool assignment for multiple spindle CNC machines, in 'Proceedings of the Forth International Conference on Evolutionary Computation', IEEE, Piscataway, NJ, pp. 425-430.
255. Norman, B. A. &: Bean, J. C. (2000), 'Scheduling operations on parallel machines', IIE Transactions 32(5), 449-459.
256. Norman, B. A., Smith, A. E. & Arapoglu, R. A. (1998), Integrated facility design using an evolutionary approach with a subordinate network algorithm, in A. E. Eiben, T. Back, M. Schoenauer & H.-P. Schwefel, eds, 'Parallel Problem Solving from Nature, PPSN V', Springer-Verlag, Berlin, pp. 937-946.
257. Odell, J. H., van Dyke Parunak, H. &: Bauer, B. (2000), Extending uml for agents, in 'Proceedings of the Agent-Oriented Information Systems Workshop at the 17th National Conference on Artificial Intelligence', pp. 3-17.
258. Odell, J., Parunak, V. D. & Bauer, B. (2001), Representing agent interaction protocols in UML, in P. Ciancarini, & M. J. Wooldridge, eds, 'Agent-Oriented Software Engineering', Springer-Verlag, Berlin, Germany, pp. 121-140.
259. Oppenheimer, D., Albrecht, J., Patterson, D. & Vahdat, A. (2005), Design and implementation tradeoffs forwide-area resource discovery, in 'Proceedings of the 14th IEEE International Symposium, Research Triangle Park, North Carolina'.
260. Osborne, M. J. & Rubinstein, A. (1994), A Course in Game Theory, MIT Press, Cambridge, MA.
261. Ostwald, J. &: Lesser, V. R. (2004), Combinatorial auctions for resource allocation in a distributed sensor network, Computer science technical report, University of Massachusetts.
262. Papadimitriou, C. H. (1981), 'On the complexity of integer programming', Journal of the ACM 28(4), 765-768.
263. Papadimitriou, C. H. (1994), 'On the complexity of the parity argument and other inefficient proofs of existence', Journal of Computer and Systems Sciences 48(3), 498-532.
264. Papadimitriou, C. H. (2001), Algorithms, games, and the internet, in 'Proceedings on 33rd Annual ACM Symposium on Theory of Computing', pp. 749-753.
265. Papadimitriou, C. H. & Steiglitz, K. (1998), Combinatorial Optimization: Algorithms and Complexity, Dover Publications, Mineola, NY.
266. Papastavrou, J., Rajagopalan, S. & Kleywegt, A. (1996), 'The dynamic and stochastic knapsack problem with deadlines', Management Science 42, 1706-1718.
267. Pareto, V. (1906), Manuale di economia politica con una introduzione alla scienza sociale, Società Editrice Libraria, Milano.
268. Parkes, D. C. (1999), iBundle: An efficient ascending price bundle auction, in 'Proceedings of the First ACM Conference on Electronic Commerce (ACM EC'99), Denver, CO', ACM, pp. 148-157.
269. Parkes, D. C. (2001a), Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency, PhD thesis, Department of Computer and Information Science, University of Pennsylvania.
270. Parkes, D. C. (2001b), An Iterative Generalized Vickrey Auction: Strategy-proofness without complete revelation, in 'Proceedings of the AAAI Spring Symposium on Game Theoretic and Decision Theoretic Agents, Stanford, CA', AAAI.
271. Parkes, D. C. (2005), Iterative combinatorial auctions, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT Press, pp. 41-77.
272. Parkes, D. C. & Kalagnanam, J. (2005), 'Models for iterative multiattribute vickrey auctions', Management Science 51, 435-451. Special Issue on Electronic Markets.
273. Parkes, D. C. & Shneidman, J. (2004), Distributed implementations of vickreyclarkegroves mechanisms, in 'Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multi Agent Systems, Bologna, Italy', pp. 261-268.
274. Parkes, D. C. & Ungar, L. H. (2000), Iterative combinatorial auctions: Theory and practice, in 'Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-00)', pp. 74-81.
275. Poggi, A. & Bergenti, F. (2001), A development toolkit to realize autonomous and inter-operable agents, in 'Proceedings of the the 5th International Conference on Autonomous Agents (Agents 2001), Montreal, Canada', pp. 632-639.
276. Polk, C. & Schulman, E. (2000), Enhancing the liquidity of bond trading, in G. Russell & J. Rosen, eds, 'The Handbook of Fixed Income Technology', Summit Group Press.
277. Porter, D., Rassenti, S. J. & Smith, V. L. (2003), Combinatorial auction design, Technical report, Interdisciplinary Center for Economic Science.
278. Principe, J. C., Euliano, N. R. & Lefebvre, W. C. (1999), Neural and Adaptive Systems: Fundamentals through Simulations, Wiley & Sons, New York, NY.
279. Puterman, M. L. (1994), Markov Decision Problems, John Wiley and Sons, New York, NY.
280. Raju, V. L. P., Narahari, Y. & Kumar, R. (2005), 'Learning dynamic prices in multi-seller electronic markets with with price sensitive customers, stochastic demands, and inventory replenishments', IEEE Transactions on Systems, Man, and Cybernetics, Part C . Special Issue on Game-theoretic Analysis and Stochastic Simulation of Negotiation Agents.
281. Rassenti, J. S., Smith, V. L. & Bulfin, R. L. (1982), 'A combinatorial auction mechanism for airport time slot allocation', The Bell Journal of Economics 13(2), 402-417.
282. Regev, O. & Nisan, N. (1998), The popcorn market: an online market for computational resources, in 'Proceedings of the first international conference on Information and computation economies', Charleston, SC, pp. 148 - 157.
283. Reinartz, W. (2001), 'Customising prices in online markets', European Business Forum 6, 35-41.
284. Reinicke, M., Eymann, T., Ardaiz, O., Artigas, P., Freitag, F. & Navarro, L. (2003), Self-organizing resource allocation for autonomic networks, in '14th International Workshop on Database and Expert Systems Applications'.
285. Riedmiller, S. C. & Riedmiller, M. A. (1999), A neural reinforcement learning approach to learn local dispatching policies in production scheduling, in 'Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI'99), Stockholm, Sweden', pp. 764-771.
286. Ronen, A. & Nisan, N. (2000), Computationally feasible vcg mechanisms, in 'Proceedings of the 2nd ACM Conference on Electronic Commerce (ACM EC-00), Minneapolis', pp. 242-252.
287. Rosenschein, J. & Zlotkin, G. (1994), Rules of Encounter, MIT Press, Cambridge, MA.
288. Rothkopf, M. H., Pekeč, A. & Harstad, R. M. (1998), 'Computationally manageable combinatorial auctions', Management Science 44(8), 1131-1147.
289. Rothlauf, F., Goldberg, D. E. & Heinzl, A. (2002), 'Network random keys - A tree network representation scheme for genetic and evolutionary algorithms', Evolutionary Computation 10(1), 75-97.
290. Roughgarden, T. (2002), How unfair is optimal routing?, in 'Proceedings of the 13. Annual ACM-SIAM Symposium on Discrete Algorithms', pp. 203-204.
291. Russel, S. & Norvig, P. (2003), Artificial Intelligence: A Modern Approach, 2 edn, Prentice Hall, New Jersey.
292. Sackmann, S. & Strüker, J. (2005), Electronic Commerce Enquête 2005 - 10 Jahre Electronic Commerce: Eine stille Revolution in deutschen Unternehmen, KIT Verlag, Institut für Informatik und Gesellschaft, Telematik, Universität Freiburg.
293. Sandholm, T. (1993), An implementation of the contract net protocol based on marginal cost calculations, in 'Proceedings of the Eleventh National Conference on Artificial Intelligence, Washington, DC', pp. 256-262.
294. Sandholm, T. (1995), Distributed rational decision making, in G. Weiss, ed., 'Multiagent Systems', MIT Press, Massachusetts, pp. 201-258.
295. Sandholm, T. (1996), Negotiation among Self-Interested Computationally Limited Agents, PhD thesis, University of Massachusetts, Amherst, MA.
296. Sandholm, T. (2002a), 'Algorithm for optimal winner determination in combinatorial auctions', Artificial Intelligence 135(1-2), 1-54.
297. Sandholm, T. (2002b), 'eMediator: A next generation electronic commerce server', Computational Intelligence 18(4), 656-676.
298. Sandholm, T. (2005), Optimal winner determination algorithms, in R. Steinberg, Y. Shoham & P. Cramton, eds, 'Combinatorial Auctions', MIT Press.
299. Sandholm, T. & Lesser, V. R. (1997), 'Coalitions among computationally bounded agents', Artificial Intelligence, special issue on Economic Principles of Multiagent Systems 94(1-2), 99-137.
300. Sandholm, T., Suri, S., Gilpin, A. & Levine, D. (2005), 'CABOB: A fast optimal algorithm for combinatorial auctions', Management Science 51(3), 374-390.
301. Satterthwaite, M. A. & Williams, S. R. (1989), 'Bilateral trade with the sealed bid k-double auction: Existence and efficiency', Journal of Economic Theory 48, 107-133.
302. Savit, R., Brueckner, S. A., van Dyke Parunak, H. & Sauter, J. A. (2003), 'Phase structure of resource allocation games', Physics Letters A 311(4-5), 359364,.
303. Scarf, H. (1982), The computation of equilibrium prices: An exposition, in M. Intriligator & K. J. Arrow, eds, 'Handbook of Mathematical Economics', Vol. 2, North-Holland Publishing, Amsterdam, chapter 21, pp. 1007-1061.
304. Scarf, H. (1994), 'The allocation of resources in the presence of indivisibilities', Journal of Economic Perspectives 8(4), 111-128.
305. Scarf, H. F. & Hansen, T. (1973), Computation of Economic Equilibrium, Yale University Press, New Haven, Connecticut.
306. Schaerf, A., Shoham, Y. & Tennenholtz, M. (1995), 'Adaptive load balancing: A study in multi-agent learning', Journal of Artificial Intelligence Research 2, 475-500.
307. Schillo, M., Bürckert, H.-J., Fischer, K. & Klusch, M. (2001), Towards a definition of robustness for market-style open multi-agent systems, in 'Proceedings of the fifth international conference on Autonomous agents (Agents '01)', ACM Press, Montreal, Quebec, Canada.
308. Schneider, J. G., Boyan, J. A. & Moore, A. W. (1998), Value function based production scheduling, in 'Proceedings 15th International Conference on Machine Learning', Morgan Kaufmann, San Francisco, CA, pp. 522-530.
309. Schumpeter, J. (1908), Das Wesen und der Hauptinhalt der Theoretischen Nationalökonomie, 3. Auflage, 1998 edn, Duncker & Humboldt Berlin.
310. Schumpeter, J. (1911), Theorie der wirtschaftlichen Entwicklung, 3. Auflage, 1997 edn, Duncker & Humboldt Berlin.
311. Schumpeter, J. (1950), Kapitalismus, Sozialismus und Demokratie, UTB für Wissenschaft, 7. Auflage, 1998 edn, A. Francke Verlag, Tübingen und Basel.
312. Schwefel, H.-P. (1995), Evolution and Optimum Seeking, Wiley-Interscience, New York, NY.
313. nd edn, Harri Deutsch, Frankfurt a. M., Thun, pp. 188-197.
314. Schwind, M. (2005a), Design of combinatorial auctions for allocation and procurement processes, in '7th International IEEE Conference on E-Commerce Technology 2005, München, Germany'.
315. Schwind, M. (2005b), Report on the NUI Galway Masterclass in computable and behavioural economics, COBERA 2005, Technical report, National University of Galway and Institute for Information Science Frankfurt.
316. nd edn, Harri Deutsch, Frankfurt a. M., Thun, pp. 340-345.
317. Schwind, M. & Gujo, O. (2006), Using shadow prices for resource allocation in a grid with proxy-bidding agents, in 'Proceedings of the 8th International Conference on Enterprise Information Systems (ICEIS 2006), Paphos, Cyprus'.
318. Schwind, M., Gujo, O. & Stockheim, T. (2006), Dynamic resource prices in a combinatorial grid system, in 'Proceedings of the IEEE Joint Conference on ECommerce Technology (CEC'06) and Enterprise Computing, E-Commerce and E-Services (EEE'06), San Francisco, CA'.
319. Schwind, M. & Meyer, S. (2001), Bekräftigungslernende Agenten als Basis für die gewinnmaximale dynamische Bepreisung von Informationsprodukten im Internet, Technical report, Institut für Wirtschaftsinformatik, Johann Wolfgang Goethe Universität, Frankfurt.
320. Schwind, M., Stockheim, T. & Gujo, O. (2006), Agents' bidding strategies in a combinatorial auction controlled grid environment, in 'Proceedings of the AAMAS 2006 Trading Agent Design and Analysis/Agent-Mediated Electronic Commerce Joint Workshop, Hakodate, Japan'.
321. Schwind, M., Stockheim, T. & Rothlauf, F. (2003), Optimization heuristics for the combinatorial auction problem, in 'Proceedings of the Congress on Evolutionary Computation CEC 2003', pp. 1588-1595.
322. Schwind, M., Stockheim, T. & Seibel, S. (2003), Price controlled resource allocation for the provision of information products and services employing combinatorial auctions, in 'Proceedings of the 11th European Conference on Information Systems (ECIS 2003), Naples Italy'.
323. Schwind, M., Weiss, K. & Stockheim, T. (2004), CAMeL - Eine Meta-Sprache für Kombinatorische Auktionen, Technical report, Institut für Wirtschaftsinformatik, Johann Wolfgang Goethe Universität, Frankfurt.
324. Schwind, M. & Wendt, O. (2002), Dynamic pricing of information products based on reinforcement learning: A yield-management approach, in M. Jarke, J. Koehler & G. Lakemeyer, eds, 'KI 2002: Advances in Artificial Intelligence, 25th Annual German Conference on AI (KI 2002), Aachen, Germany', Vol. 2479 of Lecture Notes in Computer Science, Springer Verlag, Berlin, Germany, pp. 51-66.
325. nd edn, Gabler, Wiesbaden, Germany.
326. Simsek, B., Albayrak, S. & Korth, A. (2004), Reinforcement learning for procurement agents of the factory of the future, in 'Proceedings of the Conference of Evolutionary Computation CEC 2004, Portland, OR'.
327. Smale, S. (1975), Price adjustment and global newton method, in 'Contributions to Economic Analysis', North-Holland Publishing, pp. 191-205.
328. Smale, S. (1976), 'Dynamics in general equilibrium theory', American Economic Review 66(2), 288-294.
329. Smith, B., Leimkuhler, J. & Darrow, R. (1992), 'Yield management at american airlines', Interfaces 1, 8-31.
330. Smith, V. L. (1994), 'Economics in laboratory', The Journal of Economic Perspectives 8(1), 113-131.
331. Snoek, M. (2000), Neuro-genetic order acceptance in a job shop setting, in 'Proceedings of the 7th International Conference on Neural Information Processing (ICONIP), Taejon, Korea', pp. 815-819.
332. Sowa, J. (2000), Knowledge Representation: Logical, Philosophical and Computational Foundations, Brookes/Cole, Pacific Groove, CA.
333. Spann, M., Skiera, B. & Schäfers, B. (2004), 'Measuring individual frictional costs and willingness-to-pay via name-your-own price mechanisms', Journal of Interactive Marketing 18(4), 22-36.
334. Sridharan, M. & Tesauro, G. (2000), Multi-agent q-learning and regression trees for automated pricing decisions, in 'Proceedings of the 4th International Conference on Multi-Agent Systems (ICMAS 2000), Boston, MA', IEEE Computer Society, pp. 447-448.
335. Steinberg, R. (2000), A general combinatorial auction procedure, Technical Report WP 17/00, Judge Institute of Management, University of Cambridge.
336. Stockheim, T. & Schwind, M. (2004), Agent-based scheduling in supply chain management, in 'Proceedings of the Second European Workshop on Multi-Agent System EUMAS 2004, Barcelona, Spain'.
337. Stockheim, T., Schwind, M. & Gujo, O. (2006), Agent's bidding strategies in a combinatorial auction, in K. Fischer, I. Timm, E. Andre & N. Zhong, eds, 'Multiagent System Technologies', Vol. 4196 of Lecture Notes in Artificial Intelligence, Springer, Heidelberg, pp. 37-48.
338. Stockheim, T., Schwind, M. & König, W. (2003a), A model for emergence and diffusion of software standards, in 'Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS-36), Big Island, Hawaii'.
339. Stockheim, T., Schwind,M. & König,W. (2003b), A reinforcement learning approach for supply chain management, in 'Proceedings of the First European Workshop on Multi-Agent Systems EUMAS 2003, Oxford, UK'.
340. Stockheim, T., Schwind, M., Korth, A. & Simsek, B. (2003), Supply chain yield management based on reinforcement learning, Technical Report 2003-77, Chair of Business Administration, esp. Information Systems - Goethe University of Frankfurt.
341. Stockheim, T., Schwind, M. & Weiss, K. (2006), 'Modeling diffusion of communication standards', International Journal of IT Standards and Standardization Research 4(2), 24-42.
342. Stockheim, T., Wendt, O. & Schwind, M. (2005), A trust-based negotiation mechanism for decentralized economic scheduling, in 'Proceedings of the 38th Hawaiian International Conference on System Sciences (HICSS-38), Hilton Waikoloa Village, Big Island, Hawaii'.
343. Stoica, I., Abdel-Wahab, H. & Pothen, A. (1995), A microeconomic scheduler for parallel computers, in 'Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing, IPPS'95, Santa Barbara, CA', Vol. 949 of Lecture Notes in Computer Science, Springer, pp. 200-218.
344. Stonebraker, M., Devine, R., Kronacker, M., Litwin, W., Pfeffer, A., Sah, A. & Staelin, C. (1994), An economic paradigm for query processing and data migration in mariposa, Sequoia 2000 94/49, University of California, Berkeley.
345. Stützle, T. (1999), Stochastic Local Search-Foundations and Applications, Infix, Sankt Augustin.
346. Sundermann, E. & Lemahieu, I. (1995), PET image reconstruction using simulated annealing, in 'Proceedings of the SPIE Medical Imaging '95 (Image Processing)', SPIE, pp. 378-386.
347. Sutton, R. & Barto, A. (1998), Reinforcement Learning: An Introduction, MIT-Press, Cambrige, MA.
348. Sycara, K. (1998), 'Multiagent systems', AI Magazine 10(2), 79-93.
349. Sycara, K., Paolucci, M., Giampapa, J. & van Velsen, M. (2003), 'The retsina mas infrastructure', Autonomous Agents and Multi-Agent Systems 7(1,2), 29-48.
350. Talluri, K. & van Ryzin, G. (1998), 'An analysis of bid-price controls for network revenue management', Management Science 44(11), 1577-1593.
351. Tanner, A. & Mühl, G. (2003), A combinatorial exchange for autonomous traders, in 'Proceedings of the 4th International Conference on Electronic Commerce and Web Technologies', LNCS, Springer Verlag.
352. Tardos, E. & Roughgarden, T. (2002), 'How bad is selfish routing?', Journal of the ACM (JACM) 49, 236-259.
353. Tesauro, G. (2001), Pricing in agent economies using neural networks and multiagent q-learning, in C. L. Giles & R. Sun, eds, 'Sequence Learning - Paradigms, Algorithms, and Applications', Vol. 1828 of Lecture Notes in Computer Science, Springer, pp. 288-307.
354. Tesauro, G. & Kephart, J. (2001), 'Pricing in agent economies using multi-agent q-learning', Autonomous Agents and Multi-Agent Systems 5(3), 289-304.
355. Tesfatsion, L. S. (2001), 'Introduction to the computational economics (special issue on ACE)', Computational Economics 18(1), 1-8.
356. Tesfatsion, L. S. (2006), A constructive approach to economic theory, in K. L. Judd & L. S. Tesfatsion, eds, 'Handbook of Computational Economics', Vol. Agent-Based Computational Economics of Handbooks in Economic Series, North-Holland.
357. Tsvetovat, M., Sycara, K., Chen, Y. & Ying, J. (2000), Customer coalistions in the electronic marketplace, in 'Proceedings of the Fourth International Conference on Autonomous Agents, Barcelona, Spain', ACM Press.
358. Tucker, P. & Berman, F. (1996), On market mechanisms as a software technique, Technical report, Technical report, University of California, San Diego TR CS96-513.
359. Ulph, D. & Vulkan, N. (2000), E-commerce, mass customisation and price discrimination, Technical Report 00/489, School of Economics, Finance and Management, University of Bristol, UK.
360. Uzawa, H. (1962), 'Walras' existence theorem and brower's fixed point theorem', The Economic Studies Quarterly 8(1), 59-62.
361. van Ryzin, G. & McGill, J. (1999), 'Revenue management: Research overview and prospects', Transportation Science 33(2), 233-256.
362. van Slyke, R. & Young, Y. (2000), 'Finite horizon stochastic knapsacks with applications to yield management', Operations Research 48(1), 155-172.
363. Varian, H. R. (1995), Economic mechanism design for computerized agents, in 'Proceedings of the first USENIX Workshop on Electronic Commerce', USENIX, pp. 13-21.
364. Varian, H. R. (1996), 'Differential pricing and efficiency', http://www.firstmonday.org/issues/issue2/different/.
365. Varian, H. R. & MacKie-Mason, J. (1994), Generalized Vickrey Auctions, Technical report, University of Michigan, Ann Arbor, MI.
366. Velupillai, V. (2004a), The foundations of computable general equilibrium theory, Technical report, Deparment of Economics, National University of Ireland, Galway.
367. Velupillai, V. (2004b), The unreasonable ineffectiveness of mathematics in economics, Technical Report 6, University of Trento, Italy, Department of Economics.
368. Vengerov, D. (2005), A reinforcement learning framework for utility-based scheduling in resource-constrained systems, Technical Report TR-2005-141, Sun Microsystems Labs Institute, Menlo Park.
369. Vickrey, W. (1963), 'Counterspeculation, auctions, and competitive sealed tenders', Journal of Finance 16(1), 8-37.
370. Vriend, N. J. (2002), 'Was hayek an ace?', Southern Economic Journal 68(4), 811-840.
371. Vriend, N. J. (2004), 'Ace models of market organization', Revue d'Economie Industrielle 107, 63-74.
372. Vries, S. D. & Vohra, R. (2001), 'Combinatorial auctions: A survey', INFORMS Journal on Computing 15(3), 284-309.
373. Waldspurger, C. A. (1995), Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management, PhD thesis, Massachusetts Institute of Technology.
374. Waldspurger, C. A., Hogg, T., Huberman, B. A., Kephart, J. & Stornetta, S. (1991), 'Spawn: A distributed computational economy', Software Engineering 18(2), 103-117.
375. Waldspurger, C. A. & Weihl, W. (1994), Lottery scheduling: Flexible proportionalshare resource mangement, in 'Proceedings of the First Symposium on Operating Systems Design and Implementation (OSDI '94), Monterey, CA', pp. 1-11.
376. Waldspurger, C. A. & Weihl, W. (1995), Stride scheduling: Deterministic proportional share resource managemen, Technical Report MIT/LCS/TM-528, Massachusetts Institute of Technology, Cambridge, MA.
377. Walras, L. (1896), Élements d'économie politique pure ou Théorie de la richesse sociale, Guillaimin et Cie, Paris.
378. Watkins, C. J. (1989), Learning from Delayed Rewards, PhD thesis, Cambridge University, Cambridge, MA.
379. Weatherford, L. & Bodily, S. (1992), 'A taxonomy and research overview of perishable-asset revenue management: Yield management, overbooking and pricing', Operations Research 40, 831-844.
380. Weiss, G. & Sen, S. (1996), Adaption and learning in multi-agent systems, Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin.
381. Weiss, R. M. & Mehrotra, A. (2001), 'Online dynamic pricing: Efficiency, equity and the future of e-commerce', Virginia Journal of Law and Technology 6(2), 1-6.
382. Wellman, M. P. (1993), 'A market-oriented programming environment and its application to distributed multicommodity flow problems', Journal of Artificial Intelligence Research 1, 1-23.
383. Wellman, M. P. (1994), A computational market model for distributed configuration design, in 'In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), Seattle, Washington', pp. 401-407.
384. Wellman, M. P. (1995), Market-oriented programming: Some early lessons, in S. H. Clearwater, ed., 'Market-Based Control: A Paradigm for Distributed Resource Allocation', World Scientific Publishing, Singapore.
385. Wellman, M., Walsh, W., Wurman, P. & MacKie-Mason, J. (2001), 'Auction protocols for decentralized scheduling', Games and Economic Behavior 35(1/2), 271-303.
386. Wendt, O. (1995), Tourenplanung durch den Einsatz naturanaloger Verfahren: Integration von genetischen Algorithmen und Simulated Annealing, Gabler Verlag, Wiesbaden, Germany.
387. Wendt, O., Stockheim, T., Grolik, S. & Schwind, M. (2002), Distributed ontology management: Prospects and pitfalls on our way towards a web of ontologies, in 'Dagstuhl Workshop (Event Nr. 02212) - DFG-SPP 1083 Intelligente Softwareagenten und betriebswirtschaftliche Anwendungsszenarien'.
388. Wirtz, J., Kimes, S. E., Theng, J. H. P. & Patterson, P. (2003), 'Revenue management: Resolving potential customer conflicts', Journal of Revenue and Pricing Management 2, 216-226.
389. Wolfstetter, E. (1996), 'Auctions: An introduction', Journal of Economic Surveys 10, 367-420.
390. Wolski, R., Plank, J. S., Brevik, J. & Bryan, T. (2001), 'Analyzing market-based resource allocation strategies for the computational grid', The International Journal of High Performance Computing Applications 15(3), 258-281.
391. Wolski, R., Plank, J. S., Bryan, T. & Brevik, J. (2001), G-commerce: Market formulations controlling resource allocation on the computational grid, in 'Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), San Francisco, CA', IEEE Computer Society, pp. 46-55.
392. Wooldrige, M. J. & Jennings, N. (1995), 'Intelligent agents: Theory and practice', The Knowledge Engineering Review 10(2), 115-152.
393. Wurman, P. R. & Wellman, M. P. (2000), AkBA: A progressive, anonymous-price combinatorial auction, in 'Proceedings of the Second ACM Conference on Electronic Commerce, Minneapolis', pp. 21-29.
394. Wurman, P. R., Wellman, M. P. & Walsh, W. E. (1998), The Michigan Internet AuctionBot: A configurable auction server for human and software agents, in 'Proceedings of the Second International Conference on Autonomous Agents, Minneapolis'.
395. Xia, M., Koehler, G. J. & Whinston, A. B. (2004), 'Pricing combinatorial auctions', European Journal of Operational Research 154(1), 251-270.
396. Xiong, L. & Liu, L. (2003), A reputation-based trust model for peer-to-peer ecommerce communities, in 'Proceedings of the IEEE Conference on E-Commerce (CEC'03)'.
397. Yaiche, H., Mazumdar, R. R. & Rosenberg, C. (2000), 'A game-theoretic framework for bandwidth allocation and pricing in broadband networks', EEE ACM Transactions on Networking 8(5), 667-678.
398. Ygge, F. (1998), Market-Oriented Programming and its Application to Power Load Management, PhD thesis, Lund University.
399. Ygge, F. & Akkermans, H. (1999), 'Decentralized markets versus central control: A comparative study', Journal of Artificial Intelligence Research 11, 301-333.
400. Ygge, F. & Akkermans, H. (2000), 'Resource-oriented multicommodity market algorithms', Autonomous Agents and Multi-Agent Systems 3(1), 53-71.
401. Ygge, F., Wellman, M. P. & Walsh, W. E. (2000), Combinatorial auctions for supply chain formation, in 'Proc. ACM Conference on Electronic Commerce (ACM EC'00)', Minneapolis, Minnesota, pp. 260-269.
402. Zhang, W. (1996), Reinforcement Learning for Job-Shop Scheduling, PhD thesis, Oregon State University, Corvallis, OR.
403. Zhang, W. (1999), State-Space Search: Algorithms, Complexity, Extensions, and Applications, Springer, Berlin.
404. Zhang, W. & Dietterich, T. G. (1995), A reinforcement learning approach to jobshop scheduling, in 'Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95)', Morgan Kaufmann, Orlando, FL, pp. 1114-1120.
405. Zhang, W. & Dietterich, T. G. (2000), 'Solving combinatorial optimization tasks by reinforcement learning: A general methodology applied to resource-constrained scheduling', Submitted to the Journal of Artificial Intelligence Research .
406. Zlotkin, G. & Rosenschein, J. S. (1992), A domain theory for task oriented negotiation, Technical Report 92-13, Leibniz Center for Computer Science, Hebrew University, Jerusalem, Israel.
407. Zlotkin, G. & Rosenschein, J. S. (1993), Compromise in negotiation: Exploiting worth functions over states, Technical Report 93-3, Leibniz Center for Computer Science, Hebrew University.
408. Zlotkin, G. & Rosenschein, J. S. (1996), 'Mechanism for automated negotiation in state oriented domains', Journal of Artificial Intelligence Research 5, 163-238.
409. Zurel, E. & Nisan, N. (2001), An efficient approximate allocation algorithm for combinatorial auctions, in 'Proceedings of the third annual ACM Conference on Electronic Commerce (ACM EC'01), Tampa, FL', pp. 125-136.
410. Zweben, M., Daun, B. & Deal, M. (1994), Scheduling and rescheduling with iterative repair, in M. Zweben & M. S. Fox, eds, 'Intelligent Scheduling', Morgan Kaufmann, Orlando, FL, chapter 8, pp. 121-140.
411. Zweben, M., Daun, B., Drascher, E., Deale, M., Eskey, M. & Davis, E. (1992), 'Learning to improve constraint-based scheduling', Artificial Intelligence 58, 271-296.