Although bivariate imprecise copulas have recently attracted substantial attention, the multivariate case seems still to be open. So, it is natural test first on shock model induced copulas, a family which might most useful in various applications. We investigate some of shocks are assumed and develop corresponding set copulas. In Marshall's we get coherent distributions where bounds naturally ...

Abstract We study subgame $$\phi $$ ϕ -maxmin strategies in two-player zero-sum stochastic games with a countable state space, finite action spaces, and bounded universally measurable payoff function. Here, denotes the tolerance function that assigns nonnegative tolerated error level to every subgame. Subgame...

Congestion control in the Internet relies on binary adjustment algorithms. For example, Transmission Control Protocol (TCP) in its congestion avoidance mode behaves similarly to Additive-Increase MultiplicativeDecrease (AIMD) algorithm. Chiu and Jain offer a theoretical justification for choosing AIMD: among stable linear algorithms, AIMD ensures the quickest convergence to maxmin-fair states. ...

this study compared the use of five different models to describe the growth from birth to 20 weeks of age of kids from both genders of nondescript goats. fifty nine (59) nondescript kids were weighed weekly at the university of maiduguri livestock teaching and research farm, nigeria and the live weights were modeled. biologically relevant variables were estimated for each kid from the logistic,...

This paper reports a comparison of calculated molecular properties and of 2D fragment bit-strings when used for the selection of structurally diverse subsets of a file of 44295 compounds. MaxMin dissimilarity-based selection and k-means clusterbased selection are used to select subsets containing between 1% and 20% of the file. Investigation of the numbers of bioactive molecules in the selected...

User Fairness aims at fairly distributing the network resources among users, where a user is an entity that can possibly send different flows through different paths. In this paper we first propose a criterion for user fairness based on political economics fairness theory: the User Maxmin Fairness criterion. Then we propose an architecture, User Fair Queuing (UFQ), that provides user maxmin fai...

We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possi...

We find that Epstein (2010)’s Ellsberg-style thought experiments pose, contrary to his claims, no paradox or diffi culty for the smooth ambiguity model of decision making under uncertainty developed by Klibanoff, Marinacci and Mukerji (2005). Not only are the thought experiments naturally handled by the smooth ambiguity model, but our reanalysis shows that they highlight some of its strengths c...