Access the full text.
Sign up today, get DeepDyve free for 14 days.
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
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Jun 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.