ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Computing core payments in combinatorial auctions
Full text PdfPdf (104 KB)
Source ACM SIGecom Exchanges archive
Volume 7 ,  Issue 1  (December 2007) table of contents
Pages 22-24  
Year of Publication: 2007
Authors
Robert W. Day  University of Connecticut
S. Raghavan  University of Maryland
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 10,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1345037.1345042
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
AUSUBEL, L. AND CRAMTON, P. 1999. The optimality of being efficient. Working paper, University of Maryland. Jun.
 
2
AUSUBEL, L. AND MILGROM, P. 2002. Ascending auctions with package bidding. Frontiers of Theoretical Economics 1, 1, 1-42.
 
3
BERNHEIM, B. AND WHINSTON, M. 1986. Menu auctions, resource allocation and economic influence. Quarterly Journal of Economics 101, 1-31.
 
4
DAY, R. AND RAGHAVAN, S. 2007. Fair payments for efficient allocations in public sector combinatorial auctions. Management Science 53, 9, 1389-1406.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.5 On-line Information Services
          Subjects: Commercial services

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Combinatorial algorithms

  K. Computing Milieux
  K.4 COMPUTERS AND SOCIETY
      K.4.4 Electronic Commerce
          Subjects: Payment schemes


General Terms:
Algorithms, Design


Keywords:
VCG payments, bidder-Pareto-optimality, combinatorial auctions, constraint generation, core allocations, proxy auctions

Collaborative Colleagues:
Robert W. Day: colleagues
S. Raghavan: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player