IISc IISc-Intel Resource Center on e-Business
Market Algorithms Intel

e-Exchanges

  • Achmid. B. Requirements for electronic markets architecture,. Elec. Markets Newsletter, 1, 1997.

  • Bakos. Y. Towards friction-free markets: The emerging role of electronic marketplaces on the internet. Communication of the ACM, 41:35-42, 1998.

  • Salvador Barbera and Matthew O Jackson. Strategy-proof exchange. Econometrica, 63.

  • S. Bikhchandani and J. W. Mamer. Competitive equilibrium in an exchange economy with indivisibilities. Journal of Economic Theory, 74:385-413, 1997.

  • S. Biswas and Y. Narahari. Supplier competition in electronic marketplaces. In Proceedings of the International Conference on Electronic Commerce Research, ICECR-5, Montreal, Canada, 2002.

  • A. Chavez and P. Maes. Kasbah: An agent marketplace for buying and selling goods. In First International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology (PAAM'96), pages 75-90, London, UK, 1996. Practical Application Company.

  • Giorgos Cheliotis. Bandwidth trading in the real world: Findings and implications for commodities brokerage. Technical report.

  • D. Cliff and J. Bruten. Zero is not enough: On the lower limit of agent intelligence for continuous double auction markets. Technical report, HP, 1997.

  • D. Friedman and J. Rust. The double auction market institutions, theories and evidence. Addison-Wesley Publishing Company, 1991.

  • S. Gjerstad and J.Dickhaut. Price formation in double auctions. Games and Economic Behavior, 22:1, 1998.

  • D. Gusfield and R. Irving. The stable marriage problem: Structure and algorithms. MIT Press, 1989.

  • A. J. Davenport J. Kalagnanam and H. S. Lee. Computational aspects of clearing continuous call double auctions with assignment constraints and indivisible demand. Electronic Commerce Research, page 221, 2001.

  • S. Kameshwaran and Y. Narahari. A new approach to the design of electronic exchanges. 2002.

  • S. Kameshwaran and Y. Narahari. Trade determination in multi-attribute exchanges. In Proceedings of the IEEE Conference on Electronic Commerce, CEC-2003, New Port Beach, California, 2003.

  • T. Sandholm A. Kothari and S. Suri. Solving combinatorial exchanges: Optimality vis a few partial bids. In Proceedings of AAAI workshop on AI for Business, 2002.

  • Klien Mark, Dellarocas Chrysanthos, Juan Antonio, and Rodriguez Aguilar. A knowledge based methodol-ogy for designing robust electronic markets. Technical report, Sloan School of Management, MIT, 2001.

  • R. McAfee. A dominant strategy double auction. Journal of Economic Theory, 56:434, 1992.

  • Y. Narahari. Design of secure electronic marketplaces. 2002.

  • Jayant Kalagnanam David C Parkes and Marta Eso. Vickrey-based surplus distribution in combinatorial exchanges. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-01), number 17, page To appear, 2001.

  • J. Kalagnanam D. C. Parkes and Marta Eso. Achieving budget-balance with vickrey-based payment schemes in combinatorial exchanges. Technical Report RC 22218 W0110-065, IBM Research Report, 2001.

  • J. Miller J. Rust and R. Palmer. Characterizing effective trading strategies: Insights from the computerized double auction tournament. Journal of Economic Dynamics and Control, 18:111, 1994.

  • M. Kumar L. Hasson Sairamesh, R. Mohan and C. Bender. A platform for business-to-business sell-side, private exchanges and marketplaces. IBM Systems Journal, 41(2):242-253, 2002.

  • Mark A. Satterthwaite and Steven R. Williams. The bayesian theory of the k-double auction. Technical report, The Double Auction Market Institutions (Theories and evidences), 1991.

  • Williams S. R. Satterthwaite, M. A. The bayesian theory of the k-double action. 1993.

  • Aldo Rustichini Mark A. Satterthwaite and Steven R. Williams. Convergence to efficiency in a simple market with incomplete information. Econometrica, 62(5):1041, 1994.

  • M. Silaghi. An algorithm applicable to clearing combinatorial exchanges. Technical Report CS-2002-14, Florida Institute of Technology, Florida, 2002.

  • T. Sandholm T. Smith and R. Simmons. Constructing and clearing exchanges using preference elicitation. In Proceedings of AAAI-02 workshop on Preferences in AI and CP: Symbolic Approaches, 2002.

  • Gerald Tesauro and Rajarshi Das. High-performance bidding agents for the continuous double auction, 2001. 2

  • G. Tewari and P. Maes. Design and implementation of an agent-based intermediary infrastructure for electronic markets. In Proceedings of ACM Conference on Electronic Commerce (EC-00), page 86, 2000.

  • W. Walsh P. Wurman and M. Wellman. Flexible double auctions for electronic commerce theory and implementation. Decision Support Systems, 24:17-27, 1998.

  • Yuko Sakurai Makoto Yokoo and Sigeo Matsubara. Robust double auctions protocol against false-name bids. In Proceedings of International Conference on Distributed Computing Systems (ICDCS-2001), number 21, 2001.

  • K. Yoon. The modified vickrey double auction. Journal of Economic Theory, 2001.

LITEC Intel Laboratory for Internet Technologies and E-Commerce
Department of Computer Science and Automation
Indian Institute of Science
CSA