Since the publication of Roger Fisher and William Ury's highly influential book, Getting to Yes, it has been widely recognized that there is a middle ground between winning and losing in negotiation. Yet, while Getting to Yes was long on motivation, it was short on technique. What you really want to know is on which issues you will win, on which you will lose, and on which you will have to compromise. To this question, Steven J. Brams and Alan D. Taylor bring a patented procedure that not only is fair but also actually guarantees that both parties walk away with as much of the "win-win"...
Since the publication of Roger Fisher and William Ury's highly influential book, Getting to Yes, it has been widely recognized that there is a middle ...
Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including indivisible items or issues, such as the marital property in a divorce or sovereignty in an international dispute.
Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures f...
What is the best way to divide a cake and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and each player uses a countably additive, non-atomic probability measure to evaluate the size of the pieces of cake, with different players generally using different measures. The author investigates efficiency properties (is there another partition that would make everyone at least as happy, and would make at least one player happier, than the present partition?) and fairness properties (do all players think that their piece is at least as large...
What is the best way to divide a cake and allocate the pieces among some finite collection of players? In this book, the cake is a measure space, and ...
Simple games are mathematical structures inspired by voting systems in which a single alternative, such as a bill, is pitted against the status quo. The first in-depth mathematical study of the subject as a coherent subfield of finite combinatorics--one with its own organized body of techniques and results--this book blends new theorems with some of the striking results from threshold logic, making all of it accessible to game theorists. Introductory material receives a fresh treatment, with an emphasis on Boolean subgames and the Rudin-Keisler order as unifying concepts. Advanced material...
Simple games are mathematical structures inspired by voting systems in which a single alternative, such as a bill, is pitted against the status quo...
Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a...
Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat ...
