Throughout this paper, R will denote a commutative ring with identity and M is a unitary R- module and Z will denote the ring of integers. We introduce the graph Ω(M) of module M with the set of vertices contain all nontrivial non-essential submodules of M. We investigate the interplay between graph-theoretic properties of Ω(M) and algebraic properties of M. Also, we assign the values of natura...

An inspection game is here a non-cooperative two-person-game between an inspector and an inspectee. It models a situation where the inspector controls the inspectee who has an incentive to violate certain legal obligations. A recent survey of inspection games applied to data verification, for example in nuclear material safeguards, is given in [1]. Dresher [2] described a sequential inspection ...

This paper focuses on the optimal allocation of multi-stage attacks with uncertainty in attacker’s intention. We model attack planning problem using a Markov decision process and characterize intention finite set reward functions–each represents type attacker. Based this modeling, we employ paradigm worst-case absolute regret minimization from robust game theory develop mixed-integer linear pro...

We study continuity properties of stochastic game problems with respect to various topologies on information structures, defined as probability measures characterizing a game. will establish the value function under total variation, setwise, and weak convergence structures. Our analysis reveals that for bounded is continuous variation structures in both zero-sum games team problems. Continuity ...

This work deals with subsidy transfer from a manufacturer to a retailer through the distributor in cooperative advertising. While the retailer engages in local advertising, the manufacturer indirectly participates in retail advertising using advertising subsidy which is given to the distributor, who in turn transfers it to the retailer. The manufacturer is the Stackelberg game leader; the distr...

In future battlefields and other emerging multiagent applications, agents must communicate in an inherently hostile environment in which an adversary has strong incentives to disrupt or intercept communication. Intelligent agents must balance network performance with possible harm suffered from the adversary’s attacks, given that the adversary is actively and rationally balancing his own costs ...

In this paper, we proposed and illustrated a distributed low-complex algorithm for precoding strategy selection in a multi-user Multiple-input Multiple-output (MU-MIMO) wireless system using noncooperative games. We formulate the game as a non-cooperative game for an asynchronous distributed system in multi-user MIMO system known as Partially asynchronous distributed algorithm (PADA) and the co...

A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the “yea” voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum, where the weights and the quota are restricted to be integers. In [Freixas and Molinero(2009)] the authors have classified all weighted voting games without ...