References

1

Y. Bakos and E. Brynjolfsson. Bundling information goods: Pricing, profits and efficiency. In B. Kahin and H. Varian, editors, Internet Publishing and Beyond: The Economics of Digital Information and Intellectual Property. MIT Press, Cambridge, Massachusetts, 2000.

2

D. P. Bertsekas. Nonlinear Programming. Athena Scientific, Belmont, 1995.

3

C. H. Brooks, S. Fay, R. Das, J. K. Mackie-Mason, J. O. Kephart, and E. H. Durfee. Automated search strategies in an electronic goods market: Learning and complex price scheduling. In Proceedings of the ACM Conference on Electronic Commerce, 1999.

4

J. C. Chuang and M. A. Sirbu. Network delivery of information goods: Optimal pricing of articles and subscriptions. In B. Kahin and H. Varian, editors, Internet Publishing and Beyond: The Economics of Digital Information and Intellectual Property. MIT Press, Cambridge, Massachusetts, 2000.

5

S. Fay and J. K. MacKie-Mason. Competition between firms that bundle. Manuscript, Dept. of Economics, University of Michigan, 1998.

6

J. E. Hanson and J. O. Kephart. Spontaneous specialization in a free-market economy of agents. In Proceedings of Workshop on Artificial Societies and Computational Markets at the Second International Conference on Autonomous Agents, May 1998.

7

N. L. Johnson, S. Kotz, and N. Balakrishnan. Continuous Univariate Distributions, volume 1. John Wiley & Sons, Inc., New York, 1995.

8

J. O. Kephart, J. E. Hanson, D. W. Levine, B. N. Grosof, J. Sairamesh, R. B. Segal, and S. R. White. Dynamics of an information-filtering economy. In Proceedings of Second International Workshop on Cooperative Information Agents (CIA-98), Paris, July 1998.

9

J. O. Kephart, J. E. Hanson, and J. Sairamesh. Price-war dynamics in a free-market economy of software agents. In Proceedings of Alife VI, June 1998.

10

J. C. Lagarias, J. A. Reeds, M. H. Wright, and P. E. Wright. Convergence properties of the Nelder-Mead simplex method in low dimensions. SIAM Journal on Optimization, 9(1):112-147, 1998.

11

J. K. MacKie-Mason and J. Riveros. Economics and electronic access to scholarly information. In B. Kahin and H. Varian, editors, Internet Publishing and Beyond: The Economics of Digital Information and Intellectual Property. MIT Press, Cambridge, Massachusetts, 2000.

12

A. Mas-Colell, M. Whinston, and J. Green. Microeconomic Theory. Oxford University Press, 1995.

13

K. I. M. McKinnon. Convergence of the Nelder-Mead simplex method to a nonstationary point. SIAM Journal on Optimization, 9(1):148-158, 1998.

14

L. Nazareth and P. Tseng. Gilding the lily: a variant of the Nelder-Mead algorithm. Department of Mathematics, University of Washington, Seattle, 1998.

15

J. A. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-313, 1965.

16

W. Oi. A Disneyland dilemma: Two-part tariffs for a Mickey Mouse monopoly. The Quarterly Journal of Economics, 85(1):77-96, February 1971.

17

W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, 1988.

18

S. Salop and J. Stiglitz. Bargains and ripoffs: A model of monopolistically competitive price dispersion. Review of Economic Studies, 44:493-510, October 1977.

19

Y. Shilony. Mixed pricing in oligopoly. Journal of Economic Theory, 14:373-388, April 1977.

20

V. Torczon. On the convergence of pattern search algorithms. SIAM Journal on Optimization, 7(1):1-25, 1997.

21

P. Tseng. Fortified-descent simplical search method: a general approach. Department of Mathematics, University of Washington, Seattle, 1998.

22

H. R. Varian. A model of sales. American Economic Review, 70:651-659, September 1980.

23

J. M. Vidal and E. H. Durfee. The moving target problem in multi-agent learning. In Proceedings of the Third International Conference on Multi-agent Systems (ICMAS98), 1998.

24

J. M. Vidal and E. H. Durfee. Learning nested agent models in an information economy. Journal of Experimental and Theoretical Artificial Intelligence (special issue on learning in distributed artificial intelligence systems), 1999. to appear.

25

F. H. Walters, L. R. Parker, S. L. Morgan, and S. N. Deming. Sequential Simplex Optimization. CRC Press, Boca Raton, Florida, 1991.

26

M. H. Wright. Direct search methods: once scorned, now respectable. In D. F. Griffiths and G. A. Watson, editors, Numerical Analysis: Proceedings of the 1995 Dundee Biennial Conference in Numerical Analysis, pages 191-208, Harlow, United Kingdom, 1996. Addison-Wesley Longman.