Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Editor's puzzle: strategically choosing products to release

Editor's puzzle: strategically choosing products to release Editor ™s Puzzle: Strategically Choosing Products to Release VINCENT CONITZER Duke University As usual, you are allowed to use computers to help you solve this puzzle, but the nal argument should be human-readable and as strong as possible. Solutions should be sent to the editor at conitzer@cs.duke.edu with subject header SIGecom Exchanges Puzzle. The author(s) of the most elegant solution (as judged by the editor) will be allowed to publish his or her or their proof in the next issue of the Exchanges (ties broken towards earlier submissions). To make the solution accessible to a wide audience, try to minimize technical jargon in the proof. The editor will not give any feedback on submitted solutions and ignore any requests for hints, etc. Also, the previous issue ™s puzzle on combinatorial auction winner determination was solved by each of Daniel Lehmann, Peter Stone, and Mukund Sundararajan, who submitted very similar solutions, but they did not consider their solutions elegant enough to publish. If someone submits a more elegant solution to that puzzle, I will be happy to publish it in the next issue. Hint (for that puzzle): think about prices and duality, though integrality plays a role... Now, let http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Editor's puzzle: strategically choosing products to release

ACM SIGecom Exchanges , Volume 7 (2) – Jun 1, 2008

Loading next page...
 
/lp/association-for-computing-machinery/editor-s-puzzle-strategically-choosing-products-to-release-HC9yVa5289
Publisher
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1399589.1399602
Publisher site
See Article on Publisher Site

Abstract

Editor ™s Puzzle: Strategically Choosing Products to Release VINCENT CONITZER Duke University As usual, you are allowed to use computers to help you solve this puzzle, but the nal argument should be human-readable and as strong as possible. Solutions should be sent to the editor at conitzer@cs.duke.edu with subject header SIGecom Exchanges Puzzle. The author(s) of the most elegant solution (as judged by the editor) will be allowed to publish his or her or their proof in the next issue of the Exchanges (ties broken towards earlier submissions). To make the solution accessible to a wide audience, try to minimize technical jargon in the proof. The editor will not give any feedback on submitted solutions and ignore any requests for hints, etc. Also, the previous issue ™s puzzle on combinatorial auction winner determination was solved by each of Daniel Lehmann, Peter Stone, and Mukund Sundararajan, who submitted very similar solutions, but they did not consider their solutions elegant enough to publish. If someone submits a more elegant solution to that puzzle, I will be happy to publish it in the next issue. Hint (for that puzzle): think about prices and duality, though integrality plays a role... Now, let

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Jun 1, 2008

There are no references for this article.