Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/editor-s-introduction-AU4v0hcXL0
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2007 by ACM Inc.
- ISSN
- 1551-9031
- DOI
- 10.1145/1345037.1345038
- Publisher site
- See Article on Publisher Site
Abstract
Editor ™s Introduction This is an exciting time for SIGecom Exchanges. In the past, SIGecom Exchanges has mostly published full-length research articles. While we continue to accept such articles, we are now placing more of a focus on letters, in which authors can give a quick overview of recent research, review a recent conference or book, or lay out their opinions on where research is or should be heading. This new direction is re ‚ected in this special issue on combinatorial auctions. This issue starts with œAn Overview of Combinatorial Auctions by Cramton et al. The authors give a brief overview of the key issues in combinatorial auctions. These issues are discussed in more detail in the recent book œCombinatorial Auctions, edited by these authors. The rst three letters concern the solution of the winner determination problem and the setting of appropriate prices. In œCombinatorial Auctions with Tractable Winner Determination, Gottlob and Greco discuss their recent work that signi cantly extends a class of settings where the winner determination problem can be solved in polynomial time. In œDuality in Combinatorial Auctions, Bikhchandani and Ostroy discuss linear programming formulations and the relationship of the dual
Journal
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Dec 1, 2007