An equitable risk allocation between contracting parties plays a vital role in enhancing the performance of the project. This research presents a new quantitative risk allocation approach by integrating fuzzy logic and bargaining game theory. Owing to the imprecise and uncertain nature of players’ payoffs at different risk allocation strategies, fuzzy logic is implemented to determine the value...

In many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper, we consider an equitable coloring of some corona products H G of two graphs G and H. In particular, we show that deciding the colorability of H G is NP-complete even if G is 4-regular and H is . 2 K Next, we prove exact values or upper bounds on the equ...

Let G = (V,E) be an undirected graph, where V is the set of vertices and E is that of edges. An equitable k-coloring of G is a partition of V into k disjoint stable subsets such that the difference on the cardinalities of any two subsets is at most one. Each subset is associated with a color and called a color set. The Equitable Coloring Problem (ECP) consists of finding the minimum value of k ...

Previous studies on handicapping have suggested that in matches between 2 golfers, the better golfer has an advantage. In this paper, we consider medal play between 2 golfers when they are both playing well. The study uses the new slope system for handicapping. In this context we argue that it is actually the weaker golfer who has an advantage. The conclusions are based on both the analysis of ...

freshwater lens on small islands may easily be overexploited or polluted due to overdrafts of fresh water by pumping which causes drawdown of the water table a rise or up-coning of the saltwater interface. present study is concerned with using a three-dimensional finite-difference numerical model to simulate the groundwater flow and transport model to predict the behavior of groundwater system ...

A classical result in graph theory asserts that every graph can be oriented so that the indegree and outdegree of each vertex differ by at most 1. We study the extent to which the result generalizes to uniform hypergraphs.

Random graph models have played a dominant role in the theoretical study of networked systems. The Poisson random graph of Erdős and Rényi, in particular, as well as the so-called configuration model, have served as the starting point for numerous calculations. In this paper we describe another large class of random graph models, which we call equitable random graphs and which are flexible enou...

We consider the problem of dividing a territory into sub-regions so as to balance the workloads of a collection of facilities or vehicles over that territory. We assume that the territory is a connected polygonal region, i.e. a simply connected polygon containing a set of simply connected obstacles. The territory also contains a collection of facilities, represented by a set of n fixed points i...