Independent set games are cooperative defined on graphs, where players edges and the value of a coalition is maximum cardinality independent sets in subgraph by coalition. In this paper, we investigate convexity games, as convex possess many nice properties both economically computationally. For introduced Deng et al. [5], provide necessary sufficient characterization for convexity, i.e., every...

For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

This study examines the extent and reasons for the downturn in IS/IT program enrollments since 2001. The current enrollment cycle will be compared with earlier enrollment cycles since the beginning of the modern MIS program in the 1970s. Several notable “mega-trends” that affect the enrollment cycle are suggested, and based on these “mega-trends” and other reasons underlying the downturn, innov...

I review the phenomenology of new physics in low energy processes using the notion of minimal flavor violation (vs. non-minimal flavor violation). I compare the predictions of beyond-the-standard models and show that among certain observables in rare b-decays pattern arise, which allow to distinguish between extensions of the Standard Model. I discuss the status and future of the model independ...