eMediator

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

eMediator: a next generation electronic commerce server

Full text

Pdf (1.06 MB)

Source

International Conference on Autonomous Agents archive
Proceedings of the fourth international conference on Autonomous agents table of contents

Barcelona, Spain

Pages: 341 - 348

Year of Publication: 2000

ISBN:1-58113-230-1

Author

Tuomas Sandholm

Department of Computer Science, Washington University, St. Louis, MO

Sponsors

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGCHI: ACM Special Interest Group on Computer-Human Interaction

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 17, Citation Count: 30

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/336595.337522 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	L. M. Ansubel and P. C. Cramton. Demand reduction and inefficiency in multi-unit auctions. Technical Report 96-07, U. Maryland, Dept. of Economics.
	2	Barun Chandra , Magnús Halldórsson, Greedy local improvement and weighted set packing approximation, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.169-176, January 17-19, 1999, Baltimore, Maryland, United States
	3	E. H. Clarke. Multipart pricing of public goods. Public Choice, 11:17-33, 1971.
	4	Yuzo Fujishima , Kevin Leyton-Brown , Yoav Shoham, Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.548-553, July 31-August 06, 1999
	5	T. Groves. Incentives in teams. Econometrica, 41:617-631, 1973.
	6	Magnús M. Halldórsson, Approximations of Independent Sets in Graphs, Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, p.1-13, July 18-19, 1998
	7	M. M. Halldorsson and H. C. Lau. Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and 3-coloring. Journal of Graph Algo. Applic., 1(3):1-13, 1997.
	8	J. Hastad, Clique is hard to approximate within n1-, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.627, October 14-16, 1996
	9	D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
	10	Daniel Lehmann , Liaden Ita O'Callaghan , Yoav Shoham, Truth revelation in approximately efficient combinatorial auctions, Proceedings of the 1st ACM conference on Electronic commerce, p.96-102, November 03-05, 1999, Denver, Colorado, United States [doi>10.1145/336992.337016]
	11	W. A. Lupien and J. T. Rickard. Crossing network utilizing optimal mutual satisfaction density profile. US Patent 5,689,652, granted Nov. 18, 1997.
	12	J. McMillan. Selling spectrum rights. Journal of Economic Perspectives, 8(3):145-162, 1994.
	13	H. Raiffa. The Art and Science of Negotiation. Harvard Univ. Press, Cambridge, Mass., 1982.
	14	E. Rasmusen. Games and Information. Basil Blackwell, 1989.
	15	S. J. Rassenti, V. L. Smith, and R. L. Bulfm. A combinatorial auction mechanism for airport time slot allocation. Bell J. of Economics, 13:402-417, 1982.
	16	J. A. Rodriguez-Aguilar, P. Noriega, C. Sierra, and J. Padget. FM96.5: A Java-based electronic auction house. In PAAM, 1997.
	17	Michael H. Rothkopf , Aleksandar Pekec , Ronald M. Harstad, Computationally Manageable Combinational Auctions, Management Science, v.44 n.8, p.1131-1147, August 1998 [doi>10.1287/mnsc.44.8.1131]
	18	T. W. Sandholm. An implementation of the contract net protocol based on marginal cost calculations. In AAAI, pages 256-262, Washington, D.C., July 1993.
	19	T. W. Sandholm. Limitations of the Vickrey auction in computational multiagent systems. In ICMAS, pages 299-306, Keihanna Plaza, Kyoto, Japan, 1996.
	20	Tuomas Sandholm, An Algorithm for Optimal Winner Determination in Combinatorial Auctions, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.542-547, July 31-August 06, 1999
	21	T. W. Sandholm and V. Ferrandon. Safe exchange planner. In ICMAS, Boston, MA, 2000. To appear.
	22	T. W. Sandholm and V. Lesser. Equihbrium analysis of the possibilities of unenforced exchange in multiagent systems. In IJCAI, 694-701, Montreal, 1995.
	23	T. W. Sandholm and V. R. Lesser. Advantages of a leveled commitment contracting protocol. In AAAI, pages 126-133, Portland, OR, 1996.
	24	Tuomas Sandholm , Sandeep Sikka , Samphel Norden, Algorithms for Optimizing Leveled Commitment Contracts, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, p.535-541, July 31-August 06, 1999
	25	T. W. Sandholm and S. Suri. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. 2000. Submitted.
	26	W. Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance, 16:8-37, 1961.
	27	Peter R. Wurman , Michael P. Wellman , William E. Walsh, The Michigan Internet AuctionBot: a configurable auction server for human and software agents, Proceedings of the second international conference on Autonomous agents, p.301-308, May 10-13, 1998, Minneapolis, Minnesota, United States [doi>10.1145/280765.280847]

CITED BY 30

	Daniel M. Reeves , Michael P. Wellman , Benjamin N. Grosof, Automated negotiation from declarative contract descriptions, Proceedings of the fifth international conference on Autonomous agents, p.51-58, May 2001, Montreal, Quebec, Canada
	Daniel Veit , Jörg P. Müller , Martin Schneider , Bjüorn Fiehn, Matchmaking for autonomous agents in electronic marketplaces, Proceedings of the fifth international conference on Autonomous agents, p.65-66, May 2001, Montreal, Quebec, Canada
	Guido Governatori , Marlon Dumas , Arthur H. M. ter Hofstede , Phillipa Oaks, A formal approach to protocols and strategies for (legal) negotiation, Proceedings of the 8th international conference on Artificial intelligence and law, p.168-177, May 2001, St. Louis, Missouri, United States
	Chris Preist , Andrew Byde , Claudio Bartolini, Economic dynamics of agents in multiple auctions, Proceedings of the fifth international conference on Autonomous agents, p.545-551, May 2001, Montreal, Quebec, Canada
	Tuomas Sandholm , Subhash Suri, BOB: improved winner determination in combinatorial auctions and generalizations, Artificial Intelligence, v.145 n.1-2, p.33-58, April 2003
	Shigeo Matsubara, Accelerating information revelation in ascending-bid auctions: avoiding last minute bidding, Proceedings of the 3rd ACM conference on Electronic Commerce, p.29-37, October 14-17, 2001, Tampa, Florida, USA
	Hosam Hanna , Abdel-Illah Mouaddib, Task selection problem under uncertainty as decision-making, Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3, July 15-19, 2002, Bologna, Italy
	Tuomas Sandholm , Victor Lesser, Leveled-commitment contracting: a backtracking instrument for multiagent systems, AI Magazine, v.23 n.3, p.89-100, Fall 2002
	Avrim Blum , Tuomas Sandholm , Martin Zinkevich, Online algorithms for market clearing, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.971-980, January 06-08, 2002, San Francisco, California
	Daniel Lehmann , Liadan Ita Oćallaghan , Yoav Shoham, Truth revelation in approximately efficient combinatorial auctions, Journal of the ACM (JACM), v.49 n.5, p.577-602, September 2002
	Tuomas Sandholm , Qianbo Huai, Nomad: Mobile Agent System for an Internet-Based Auction House, IEEE Internet Computing, v.4 n.2, p.80-86, March 2000
	Craig Boutilier, Solving concisely expressed combinatorial auction problems, Eighteenth national conference on Artificial intelligence, p.359-366, July 28-August 01, 2002, Edmonton, Alberta, Canada
	Athena Vakali , Lefteris Angelis , Dimitra Pournara, Internet based auctions: a survey on models and applications, ACM SIGecom Exchanges, v.2 n.2, p.6-15, Spring, 2001
	Chris Preist , Claudio Bartolini , Andrew Byde, Agent-based service composition through simultaneous negotiation in forward and reverse auctions, Proceedings of the 4th ACM conference on Electronic commerce, p.55-63, June 09-12, 2003, San Diego, CA, USA
	Takayuki Ito , Makoto Yokoo , Shigeo Matsubara, Towards a combinatorial auction protocol among experts and amateurs: the case of single-skilled experts, Proceedings of the second international joint conference on Autonomous agents and multiagent systems, July 14-18, 2003, Melbourne, Australia
	Xudong Luo , Nicholas R. Jennings , Nigel Shadbolt , Ho-fung Leung , Jimmy Ho-man Lee, A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments, Artificial Intelligence, v.148 n.1-2, p.53-102, August 2003
	Jawad Abrache , Benoît Bourbeau , Teodor Gabriel Crainic , Michel Gendreau, A new bidding framework for combinatorial e-auctions, Computers and Operations Research, v.31 n.8, p.1177-1203, July 2004
	Kate Larson , Tuomas Sandholm, Costly valuation computation in auctions, Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge, July 08-10, 2001, Siena, Italy
	Teddy Candale , Sandip Sen, A comparison of bidding strategies for simultaneous auctions, ACM SIGecom Exchanges, v.5 n.5, p.41-48, January 2006
	Tuomas Sandholm, Issues in computational Vickrey auctions, International Journal of Electronic Commerce, v.4 n.3, p.107-129, March 2000
	Teddy Candale , Sandip Sen, Evaluating bidding strategies for simultaneous auctions, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, May 08-12, 2006, Hakodate, Japan
	Takayuki Ito , Makoto Yokoo , Shigeo Matsubara, Designing an auction protocol under asymmetric information on nature's selection, Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1, July 15-19, 2002, Bologna, Italy
	Eugene Fink , Jianli Gong , Josh Johnson, Exchange market for complex commodities: search for optimal matches, Journal of Experimental & Theoretical Artificial Intelligence, v.19 n.2, p.91-117, June 2007
	Sandip Sen , Teddy Candale , Susnata Basak, Profit sharing auction, Proceedings of the 20th national conference on Artificial intelligence, p.170-175, July 09-13, 2005, Pittsburgh, Pennsylvania
	Madalina Croitoru , Cornelius Croitoru , Paul Lewis, BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions, Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, p.871-872, June 27, 2008
	Teddy Candale , Sandip Sen, Multi-dimensional bid improvement algorithm for simultaneous auctions, Proceedings of the 20th international joint conference on Artifical intelligence, p.1215-1220, January 06-12, 2007, Hyderabad, India
	Thomas Sandholm, Making markets and democracy work: a story of incentives and computing, Proceedings of the 18th international joint conference on Artificial intelligence, p.1649-1671, August 09-15, 2003, Acapulco, Mexico
	Tuomas Sandholm , Subhash Suri, Market clearability, Proceedings of the 17th international joint conference on Artificial intelligence, p.1145-1151, August 04-10, 2001, Seattle, WA, USA
	Craig Boutilier , Holger H. Hoos, Bidding languages for combinatorial auctions, Proceedings of the 17th international joint conference on Artificial intelligence, p.1211-1217, August 04-10, 2001, Seattle, WA, USA
	Tuomas Sandholm , Subhash Suri , Andrew Gilpin , David Levine, CABOB: a fast optimal algorithm for combinatorial auctions, Proceedings of the 17th international joint conference on Artificial intelligence, p.1102-1108, August 04-10, 2001, Seattle, WA, USA