The process of computing the nucleolus of arbitrary transferable utility games is notoriously hard. A number of papers have appeared in which the nucleolus is computed by an algorithm in which either one or a huge number of huge linear programs have to be solved. <p>We show that on the class of...</p>

This paper studies a noncooperative allocation procedure for coalitional games with veto players. The procedure is similar to the one presented by Dagan et al. (1997) for bankruptcy problems. According to it, a player, the proposer, makes a proposal that the remaining players must accept or...

The Ellsberg paradox demonstrates that people's beliefs over uncertain events might not be representable by subjective probability. We show that if a risk averse decision maker, who has a well defined Bayesian prior, perceives an Ellsberg type decision problem as possibly composed of a bundle of...

Previous studies present an extensive coverage of cloud computing as a disruptive technology. Building from these studies, the aim of this research was to gain more understanding of the innovation of the business model of customers as a result of adopting cloud service delivery models. Our...

The Ellsberg Paradox demonstrates that people's belief over uncertain events might not be representable by subjective probability. We show that if a risk averse decision maker, who has a well defined Bayesian prior, perceives an Ellsberg type decision problem as possibly composed of a bundle of...

We characterize a monotonic core concept defined on the class of veto balanced games. We also discuss what restricted versions of monotonicity are possible when selecting core allocations. We introduce a family of monotonic core concepts for veto balanced games and we show that, in general, the...