Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon into triangles. The MaxMin area triangulation is the triangulation of the polygon that maximizes the area of the smallest area triangle in the triangulation. There exists a dynamic programming algorithm that computes ...

Cloud computing is a platform that provides user to implement revolutionary technologies. The main phenomena of cloud computing is based on accessing the resources using remote computation. Task scheduling is one of the major area that should be focused on. In cloud environment there may be a condition where the resources are limited that may affect resource availability. This paper presents an...

Abstract In this paper, we analyse higher-order risky choices by the representative cumulative prospect theory (CPT) decision maker from three alternative reference points. These are status quo, average payout and maxmin. The choice tasks consider in our analysis include binary risks, ones employed experimental literature on higher order risk preferences. We demonstrate that made subject depend...

This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal...

Cognitive jammers are able to deploy advanced strategies that degrade the performance of cognitive radio user communications. In this paper, we study the problem of power allocation in cognitive radio user and jammer games, over parallel Gaussian channels. We model the interaction between a communicator (a transmitter-receiver pair) and a jammer using zero-sum games with continuous action sets;...

We adapt the competitive location model based on maximal covering to include the knowledge that a competitor will enter the market later with a single new facility. The objective is to locate facilities under a budget constraint in order to maximise the remaining market share after the competitor’s later entry. We develop mixed zero-one programming formulations for each of the following three s...

The objective of this paper is to provide continuous utility representation theorems analogous to Debreu’s classic utility representation theorem, albeit for preference relations that may fail to be complete and/or transitive. Specifically, we show that every (continuous and) reflexive binary relation on a (compact) metric space can be represented by means of the maxmin, or dually, minmax, of a...

Knowledge about efficient usage of network resources is an important prerequisite for user collaboration in a static networked environment. Most of the network infrastructure internals cannot be directly sensed by users, except traffic allowances and response times. Here we will provide a technical approach for demonstrating to the user, how much changing traffic flows can guide to better emplo...