Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/336595.337522acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article
Free access

eMediator: a next generation electronic commerce server

Published: 01 June 2000 Publication History
First page of PDF

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]
B. Chandra and M. M. Halldorsson. Greedy local search and weighted set packing approximation. In SODA, pages 169-176, Jan. 1999.
[3]
E. H. Clarke. Multipart pricing of public goods. Public Choice, 11:17-33, 1971.
[4]
Y. Fujishima, K. Leyton-Brown, and Y. Shoham. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In IJCAI, pages 548-553, 1999.
[5]
T. Groves. Incentives in teams. Econometrica, 41:617-631, 1973.
[6]
M. M. Hallddrsson. Approximations of independent sets in graphs. In K. Jansen and J. Rolim, eds, First International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pages 1-14, Aalborg, Denmark, 1998. Springer LNCS 1444.
[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. Hhstad. Clique is hard to approximate within n 1-e. Acta Mathematica, 1999. To appear. Draft: Royal Institute of Technology, Sweden, 8/11/98. Early version: FOCS-96, 627-636.
[9]
D. S. Hochbaum. Efficient bounds for the stable set, vertex cover, and set packing problems. Discrete Applied Mathematics, 6:243-254, 1983.
[10]
D. Lehmann, L. I. O'Callaghan, and Y. Shoham. Truth revelation in rapid, approximately efficient combinatorial auctions. In ACM Conference on Electronic Commerce, pages 96-102, Denver, 1999.
[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]
M. H. Rothkopf, A. Pekec, and R. M. Harstad. Computationally manageable combinatorial auctions. Management Science, 44(8):1131-1147, 1998.
[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]
T. W. Sandholm. An algorithm for optimal winner determination in combinatorial auctions. In IJCAI, pages 542-547, Stockholm, Sweden, 1999. Extended version: Washington Univ., Dept. of Computer Science, tech report WUCS-99-01, January 28th.
[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]
T. W. Sandholm, S. Sikka, and S. Norden. Algorithms for optimizing leveled commitment contracts. In IJCAI, pages 535-540, Stockholm, Sweden, 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]
P. R. Wurman, M. P. Wellman, and W. E. Walsh. The Michigan Internet AuctionBot: A configurable auction server for human and software agents. In A GENTS, pages 301-308, Minneapolis/St. Paul, MN, 1998.

Cited By

View all
  • (2020)Mechanism Design for Online Resource AllocationACM SIGMETRICS Performance Evaluation Review10.1145/3410048.341005548:1(11-12)Online publication date: 9-Jul-2020
  • (2020)Online Optimization with Predictions and Non-convex LossesACM SIGMETRICS Performance Evaluation Review10.1145/3410048.341005448:1(9-10)Online publication date: 9-Jul-2020
  • (2018)Natural Boundary Conditions for Smoothing in Geometry ProcessingACM Transactions on Graphics10.1145/318656437:2(1-13)Online publication date: 12-May-2018
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
AGENTS '00: Proceedings of the fourth international conference on Autonomous agents
June 2000
508 pages
ISBN:1581132301
DOI:10.1145/336595
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2000

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

Agents00

Acceptance Rates

Overall Acceptance Rate 182 of 599 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)70
  • Downloads (Last 6 weeks)5
Reflects downloads up to 20 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2020)Mechanism Design for Online Resource AllocationACM SIGMETRICS Performance Evaluation Review10.1145/3410048.341005548:1(11-12)Online publication date: 9-Jul-2020
  • (2020)Online Optimization with Predictions and Non-convex LossesACM SIGMETRICS Performance Evaluation Review10.1145/3410048.341005448:1(9-10)Online publication date: 9-Jul-2020
  • (2018)Natural Boundary Conditions for Smoothing in Geometry ProcessingACM Transactions on Graphics10.1145/318656437:2(1-13)Online publication date: 12-May-2018
  • (2018)Automatically Distributing Eulerian and Hybrid Fluid Simulations in the CloudACM Transactions on Graphics10.1145/317355137:2(1-14)Online publication date: 22-Jun-2018
  • (2018)Auction Mechanisms for Virtualization in 5G Cellular Networks: Basics, Trends, and Open ChallengesIEEE Communications Surveys & Tutorials10.1109/COMST.2018.281139520:3(2264-2293)Online publication date: Nov-2019
  • (2016)Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality ConstraintsComputational Economics10.1007/s10614-015-9496-547:3(401-421)Online publication date: 1-Mar-2016
  • (2012)Latent Geospatial Semantics of Social MediaACM Transactions on Intelligent Systems and Technology10.1145/2337542.23375493:4(1-20)Online publication date: 1-Sep-2012
  • (2012)Latent Community Topic AnalysisACM Transactions on Intelligent Systems and Technology10.1145/2337542.23375483:4(1-21)Online publication date: 1-Sep-2012
  • (2012)Identify Online Store Review Spammers via Social Review GraphACM Transactions on Intelligent Systems and Technology10.1145/2337542.23375463:4(1-21)Online publication date: 1-Sep-2012
  • (2009)AgEx: A Financial Market Simulation Tool for Software AgentsEnterprise Information Systems10.1007/978-3-642-01347-8_58(704-715)Online publication date: 2009
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media