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>

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...

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...

In a paper in 1975, Dubey characterized the Shapley-Shubik index axiomatically on the class of monotonic simple games. In 1979, Dubey and Shapley characterized the Banzhaf index in a similar way. This paper extends these characterizations to axiomatic characterizations of the Shapley and Banzhaf...

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...

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...