Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Results found: 2

first rewind previous Page / 1 next fast forward last

Search results

help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
100%
EN
The authors focus on the problem of investigating the blackmail power of players in simple games, which is the possibility of players of threatening coalitions to cause them loss using arguments that are (apparently) unjustified. To this purpose, the classical notion of the criticality of players has been ex-tended, in order to characterize situations where players may gain more power over the members of a coalition thanks to collusion with other players.
EN
We consider the allocation of a finite number of homogeneous divisible items among three players. Under the assumption that each player assigns a positive value to every item, we develop a simple algorithm that returns a Pareto optimal and equitable allocation. This is based on the tight relationship between two geometric objects of fair division: The Individual Pieces Set (IPS) and the Radon–Nykodim Set (RNS). The algorithm can be considered as an extension of the Adjusted Winner procedure by Brams and Taylor to the three-player case, without the guarantee of envy-freeness.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.