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: borrowing as cheaply as possible

Editor's puzzle: borrowing as cheaply as possible Editor ™s Puzzle: Borrowing as Cheaply as Possible VINCENT CONITZER Duke University 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. Until the winner is chosen, the editor will not give any feedback on submitted solutions and ignore any requests for hints, etc. Zoe needs to borrow $1000 from other people and is determined to do so as cheaply as possible. The various people involved each have di €erent amounts of their own money that they can lend, and are willing to lend only to certain other people; for each of the people they are willing to lend to, they have a certain pro t that they expect and, in some cases, a maximum amount they are willing to lend to that person. Speci cally: ”Alice has $400. Alice is willing to lend to Denise, but wants a pro t http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Editor's puzzle: borrowing as cheaply as possible

ACM SIGecom Exchanges , Volume 9 (1) – Jun 1, 2010

Loading next page...
 
/lp/association-for-computing-machinery/editor-s-puzzle-borrowing-as-cheaply-as-possible-NPmQaNCB9f

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 © 2010 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1980534.1980543
Publisher site
See Article on Publisher Site

Abstract

Editor ™s Puzzle: Borrowing as Cheaply as Possible VINCENT CONITZER Duke University 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. Until the winner is chosen, the editor will not give any feedback on submitted solutions and ignore any requests for hints, etc. Zoe needs to borrow $1000 from other people and is determined to do so as cheaply as possible. The various people involved each have di €erent amounts of their own money that they can lend, and are willing to lend only to certain other people; for each of the people they are willing to lend to, they have a certain pro t that they expect and, in some cases, a maximum amount they are willing to lend to that person. Speci cally: ”Alice has $400. Alice is willing to lend to Denise, but wants a pro t

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Jun 1, 2010

There are no references for this article.