Abstract: In this paper, a non-cooperative game method is
formulated where all players compete to transmit at higher
power. Every base station represents a player in the game.
The game is solved by obtaining the Nash equilibrium (NE)
where the game converges to optimality. The proposed method,
named Power Efficient Handover Game Theoretic (PEHO-GT)
approach, aims to control the handover in dense small cell
networks. Players optimize their payoff by adjusting the
transmission power to improve the performance in terms of
throughput, handover, power consumption and load balancing.
To select the desired transmission power for a player, the payoff
function considers the gain of increasing the transmission power.
Then, the cell selection takes place by deploying Technique for
Order Preference by Similarity to an Ideal Solution (TOPSIS).
A game theoretical method is implemented for heterogeneous
networks to validate the improvement obtained. Results reveal
that the proposed method gives a throughput improvement while
reducing the power consumption and minimizing the frequent
handover.
Abstract: We present a discrete game theoretical model with
homogeneous individuals who make simultaneous decisions. In
this model the strategy space of all individuals is a discrete
and dichotomous set which consists of two strategies. We fully
characterize the coherent, split and mixed strategies that form Nash
equilibria and we determine the corresponding Nash domains for all
individuals. We find all strategic thresholds in which individuals can
change their mind if small perturbations in the parameters of the
model occurs.
Abstract: One important paradigm of industry 4.0 is Cloud Manufacturing (CM). In CM everything is considered as a service, therefore, the CM platform should consider all service provider's capabilities and tries to integrate services in an equilibrium state. This research develops a framework for implementing manufacturing cloud service composition in the equilibrium state. The developed framework using well-known tools called axiomatic design (AD) and game theory. The research has investigated the factors for forming equilibrium for measures of the manufacturing cloud service composition. Functional requirements (FRs) represent the measures of manufacturing cloud service composition in the equilibrium state. These FRs satisfied by related Design Parameters (DPs). The FRs and DPs are defined by considering the game theory, QoS, consumer needs, parallel and cooperative services. Ultimately, four FRs and DPs represent the framework. To insure the validity of the framework, the authors have used the first AD’s independent axiom.
Abstract: An envy behavioral game theoretical model with two
types of homogeneous players is considered in this paper. The
strategy space of each type of players is a discrete set with only
two alternatives. The preferences of each type of players is given
by a discrete utility function. All envy strategies that form Nash
equilibria and the corresponding envy Nash domains for each type
of players have been characterized. We use geometry to construct
two dimensional envy tilings where the horizontal axis reflects the
preference for players of type one, while the vertical axis reflects
the preference for the players of type two. The influence of the envy
behavior parameters on the Cartesian position of the equilibria has
been studied, and in each envy tiling we determine the envy Nash
equilibria. We observe that there are 1024 combinatorial classes of
envy tilings generated from envy chromosomes: 256 of them are
being structurally stable while 768 are with bifurcation. Finally, some
conditions for the disparate envy Nash equilibria are stated.
Abstract: The capacity of conventional cellular networks has
reached its upper bound and it can be well handled by introducing
femtocells with low-cost and easy-to-deploy. Spectrum interference
issue becomes more critical in peace with the value-added multimedia
services growing up increasingly in two-tier cellular networks.
Spectrum allocation is one of effective methods in interference
mitigation technology. This paper proposes a game-theory-based on
OFDMA downlink spectrum allocation aiming at reducing co-channel
interference in two-tier femtocell networks. The framework is
formulated as a non-cooperative game, wherein the femto base
stations are players and frequency channels available are strategies.
The scheme takes full account of competitive behavior and
fairness among stations. In addition, the utility function reflects
the interference from the standpoint of channels essentially. This
work focuses on co-channel interference and puts forward a negative
logarithm interference function on distance weight ratio aiming
at suppressing co-channel interference in the same layer network.
This scenario is more suitable for actual network deployment and
the system possesses high robustness. According to the proposed
mechanism, interference exists only when players employ the same
channel for data communication. This paper focuses on implementing
spectrum allocation in a distributed fashion. Numerical results show
that signal to interference and noise ratio can be obviously improved
through the spectrum allocation scheme and the users quality of
service in downlink can be satisfied. Besides, the average spectrum
efficiency in cellular network can be significantly promoted as
simulations results shown.
Abstract: In decision making under strict uncertainty, decision makers have to choose a decision without any information about the states of nature. The classic criteria of Laplace, Wald, Savage, Hurwicz and Starr are introduced and compared in a case study of sewer network planning. Furthermore, results from different criteria are discussed and analyzed. Moreover, this paper discusses the idea that decision making under strict uncertainty (DMUSU) can be viewed as a two-player game and thus be solved by a solution concept in game theory: Nash equilibrium.
Abstract: In this paper, we study a distributed control algorithm
for the problem of unknown area coverage by a network of robots.
The coverage objective is to locate a set of targets in the area and
to minimize the robots’ energy consumption. The robots have no
prior knowledge about the location and also about the number of the
targets in the area. One efficient approach that can be used to relax
the robots’ lack of knowledge is to incorporate an auxiliary learning
algorithm into the control scheme. A learning algorithm actually
allows the robots to explore and study the unknown environment
and to eventually overcome their lack of knowledge. The control
algorithm itself is modeled based on game theory where the network
of the robots use their collective information to play a non-cooperative
potential game. The algorithm is tested via simulations to verify its
performance and adaptability.
Abstract: Many cluster based routing protocols have been
proposed in the field of wireless sensor networks, in which a group of
nodes are formed as clusters. A cluster head is selected from one
among those nodes based on residual energy, coverage area, number
of hops and that cluster-head will perform data gathering from
various sensor nodes and forwards aggregated data to the base station
or to a relay node (another cluster-head), which will forward the
packet along with its own data packet to the base station. Here a
Game Theory based Diligent Energy Utilization Algorithm (GTDEA)
for routing is proposed. In GTDEA, the cluster head selection is done
with the help of game theory, a decision making process, that selects
a cluster-head based on three parameters such as residual energy
(RE), Received Signal Strength Index (RSSI) and Packet Reception
Rate (PRR). Finding a feasible path to the destination with minimum
utilization of available energy improves the network lifetime and is
achieved by the proposed approach. In GTDEA, the packets are
forwarded to the base station using inter-cluster routing technique,
which will further forward it to the base station. Simulation results
reveal that GTDEA improves the network performance in terms of
throughput, lifetime, and power consumption.
Abstract: This paper addresses the issue of resource allocation
in the emerging cognitive technology. Focusing the Quality of
Service (QoS) of Primary Users (PU), a novel method is proposed for
the resource allocation of Secondary Users (SU). In this paper, we
propose the unique Utility Function in the game theoretic model of
Cognitive Radio which can be maximized to increase the capacity of
the Cognitive Radio Network (CRN) and to minimize the
interference scenario. Utility function is formulated to cater the need
of PUs by observing Signal to Noise ratio. Existence of Nash
Equilibrium for the postulated game is established.
Abstract: This paper presents a state-of-the-art survey of the
operations research models developed for internal audit planning.
Two alternative approaches have been followed in the literature for
audit planning: (1) identifying the optimal audit frequency; and (2)
determining the optimal audit resource allocation. The first approach
identifies the elapsed time between two successive audits, which can
be presented as the optimal number of audits in a given planning
horizon, or the optimal number of transactions after which an audit
should be performed. It also includes the optimal audit schedule. The
second approach determines the optimal allocation of audit frequency
among all auditable units in the firm. In our review, we discuss both
the deterministic and probabilistic models developed for audit
planning. In addition, game theory models are reviewed to find the
optimal auditing strategy based on the interactions between the
auditors and the clients.
Abstract: In this paper a new methodology for vendor selection
and supply quotas determination (VSSQD) is proposed. The problem
of VSSQD is solved by the model that combines revised weighting
method for determining the objective function coefficients, and a
multiple objective linear programming (MOLP) method based on the
cooperative game theory for VSSQD. The criteria used for VSSQD
are: (1) purchase costs and (2) product quality supplied by individual
vendors. The proposed methodology has been tested on the example
of flour purchase for a bakery with two decision makers.
Abstract: Game theory is the study of how people interact and
make decisions to handle competitive situations. It has mainly been
developed to study decision making in complex situations. Humans
routinely alter their behaviour in response to changes in their social
and physical environment. As a consequence, the outcomes of
decisions that depend on the behaviour of multiple decision makers
are difficult to predict and require highly adaptive decision-making
strategies. In addition to the decision makers may have preferences
regarding consequences to other individuals and choose their actions
to improve or reduce the well-being of others. Nash equilibrium is a
fundamental concept in the theory of games and the most widely used
method of predicting the outcome of a strategic interaction in the
social sciences. A Nash Equilibrium exists when there is no unilateral
profitable deviation from any of the players involved. On the other
hand, no player in the game would take a different action as long as
every other player remains the same.
Abstract: The performance of any cooperative communication system depends largely on the selection of a proper partner. Another important factor to consider is an efficient allocation of resource like power by the source node to help it in forwarding information to the destination. In this paper, we look at the concepts of partner selection and resource (power) allocation for a distributed communication network. A type of non-cooperative game referred to as Trade-Off game is employed so as to jointly consider the utilities of the source and relay nodes, where in this case, the source is the node that requires help with forwarding of its information while the partner is the node that is willing to help in forwarding the source node’s information, but at a price. The approach enables the source node to maximize its utility by selecting a partner node based on (i) the proximity of the partner node to the source and destination nodes, and (ii) the price the partner node will charge for the help being rendered. Our proposed scheme helps the source locate and select the relay nodes at ‘better’ locations and purchase power optimally from them. It also aids the contending relay nodes maximize their own utilities as well by asking proper prices. Our game scheme is seen to converge to unique equilibrium.
Abstract: Restructuring of Electricity supply industry introduced many issues such as transmission pricing, transmission loss allocation and congestion management. Many methodologies and algorithms were proposed for addressing these issues. In this paper a power flow tracing based method is proposed which involves Matrices methodology for the transmission usage and loss allocation for generators and demands. This method provides loss allocation in a direct way because all the computation is previously done for usage allocation. The proposed method is simple and easy to implement in a large power system. Further it is less computational because it requires matrix inversion only a single time. After usage and loss allocation cooperative game theory is applied to results for finding efficient economic signals. Nucleolus and Shapely value approach is used for optimal allocation of results. Results are shown for the IEEE 6 bus system and IEEE 14 bus system.
Abstract: The performance of state of the art worldwide telecommunication networks strongly depends on the efficiency of the applied routing mechanism. Game theoretical approaches to this problem offer new solutions. In this paper a new continuous network routing model is defined to describe data transfer in fixed telecommunication networks of multiple hosts. The nodes of the network correspond to routers whose latency is assumed to be traffic dependent. We propose that the whole traffic of the network can be decomposed to a finite number of tasks, which belong to various hosts. To describe the different latency-sensitivity, utility functions are defined for each task. The model is used to compare router and host intelligent types of routing methods, corresponding to various data transfer protocols. We analyze host intelligent routing as a transferable utility cooperative game with externalities. The main aim of the paper is to provide a framework in which the efficiency of various routing algorithms can be compared and the transferable utility game arising in the cooperative case can be analyzed.
Abstract: Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of largescale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven by different goals such as to minimize their communication costs, latency, etc. In this paper, we will use game theoretical techniques and in particular auctions to identify a bidding mechanism that encapsulates the selfishness of the agents, while having a controlling hand over them. In essence, the proposed game theory based mechanism is the study of what happens when independent agents act selfishly and how to control them to maximize the overall performance. A bidding mechanism asks how one can design systems so that agents- selfish behavior results in the desired system-wide goals. Experimental results reveal that this mechanism provides excellent solution quality, while maintaining fast execution time. The comparisons are recorded against some well known techniques such as greedy, branch and bound, game theoretical auctions and genetic algorithms.
Abstract: Since the advent of the information era, the Internet has
brought various positive effects in everyday life. Nevertheless,
recently, problems and side-effects have been noted. Internet
witch-trials and spread of pornography are only a few of these
problems.In this study, problems and causes of malicious replies on
internet boards were analyzed, using the key ideas of game theory. The
study provides a mathematical model for the internet reply game to
devise three possible plans that could efficiently counteract malicious
replies. Furthermore, seven specific measures that comply with one of
the three plans were proposed and evaluated according to the
importance and utility of each measure using the orthogonal array
survey and SPSS conjoint analysis.The conclusion was that the most
effective measure would be forbidding unsigned user access to
malicious replies. Also notable was that some analytically proposed
measures, when implemented, could backfire and encourage malicious
replies.
Abstract: This paper presents an economic game for sybil
detection in a distributed computing environment. Cost parameters
reflecting impacts of different sybil attacks are introduced in the sybil
detection game. The optimal strategies for this game in which both
sybil and non-sybil identities are expected to participate are devised.
A cost sharing economic mechanism called Discriminatory
Rewarding Mechanism for Sybil Detection is proposed based on this
game. A detective accepts a security deposit from each active agent,
negotiates with the agents and offers rewards to the sybils if the latter
disclose their identity. The basic objective of the detective is to
determine the optimum reward amount for each sybil which will
encourage the maximum possible number of sybils to reveal
themselves. Maintaining privacy is an important issue for the
mechanism since the participants involved in the negotiation are
generally reluctant to share their private information. The mechanism
has been applied to Tor by introducing a reputation scoring function.
Abstract: Markov games can be effectively used to design
controllers for nonlinear systems. The paper presents two novel
controller design algorithms by incorporating ideas from gametheory
literature that address safety and consistency issues of the
'learned' control strategy. A more widely used approach for
controller design is the H∞ optimal control, which suffers from high
computational demand and at times, may be infeasible. We generate
an optimal control policy for the agent (controller) via a simple
Linear Program enabling the controller to learn about the unknown
environment. The controller is facing an unknown environment and
in our formulation this environment corresponds to the behavior rules
of the noise modeled as the opponent. Proposed approaches aim to
achieve 'safe-consistent' and 'safe-universally consistent' controller
behavior by hybridizing 'min-max', 'fictitious play' and 'cautious
fictitious play' approaches drawn from game theory. We empirically
evaluate the approaches on a simulated Inverted Pendulum swing-up
task and compare its performance against standard Q learning.
Abstract: In this article we propose to model Net-banking
system by game theory. We adopt extensive game to model our web
application. We present the model in term of players and strategy.
We present UML diagram related the protocol game.