Showing 1 - 5 of 5
We consider a cooperative game with a bipartition that indicates which players are participating. This paper provides an analytical solution for the Shapley value when the worth of a coalition only depends on the number of participating coalition players. The computational complexity grows...
Persistent link: https://www.econbiz.de/10011256161
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …
Persistent link: https://www.econbiz.de/10005281875
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …
Persistent link: https://www.econbiz.de/10011256535
For more than three decades, empirical analysis of stochastic dominance was restricted to settings with mutually exclusive choice alternatives. In recent years, a number of methods for testing efficiency of diversified portfolios have emerged, which can be classified into three main categories:...
Persistent link: https://www.econbiz.de/10011255464
For more than three decades, empirical analysis of stochastic dominance was restricted to settings with mutually exclusive choice alternatives. In recent years, a number of methods for testing efficiency of diversified portfolios have emerged, which can be classified into three main categories:...
Persistent link: https://www.econbiz.de/10008611034