Jack and Jill have both applied for the same entry-level position at a local university. After interviewing the leading candidates, the members of the hiring committee agree that both Jack and Jill have all the necessary qualifications for appointment to the position. Both have the required education and training. Both have strong letters of recommendation from their Ph.D. supervisors and from their current employers. Both are similarly experienced and both are potentially capable of making important future contributions to their chosen (...) discipline. The members of the hiring committee also agree that Jack and Jill are superior to all other applicants for the position. In short, in the judgment of the hiring committee, they are the two best qualified candidates and both meet their potential employer's expectations concerning a successful applicant. Yet neither Jack nor Jill is clearly superior to the other. (shrink)
NOTES: Based on the book Socrates on trial written by Andrew Irvine and published by the University of Toronto Press. Performed at the Chan Centre for the Performing Arts, University of British Columbia, Vancouver, Canada, May 31-June 7, 2008. CONTENTS: Trailer, Who was Socrates?, Selected scenes, The production, Credits. UBC Library Catalogue Permanent URL: http://resolve.library.ubc.ca/cgi-bin/catsearch?bid=3956307.
Abstract Newcomb's problem is regularly described as a problem arising from equally defensible yet contradictory models of rationality. Braess? paradox is regularly described as nothing more than the existence of non?intuitive (but ultimately non?contradictory) equilibrium points within physical networks of various kinds. Yet it can be shown that Newcomb's problem is structurally identical to Braess? paradox. Both are instances of a well?known result in game theory, namely that equilibria of non?cooperative games are generally Pareto?inefficient. Newcomb's problem is simply a limiting (...) case in which the number of players equals one. Braess? paradox is another limiting case in which the ?players? need not be assumed to be discrete individuals. The result is that Newcomb's problem is no more difficult to solve than (the easy to solve) Braess? paradox. (shrink)