Abstract: Based on activity method, this paper focuses on morning commuting behavior when commuters travel with autonomous vehicles (AVs). Firstly, a net utility function of commuters is constructed by the activity utility of commuters at home, in car and at workplace, and the disutility of travel time cost and that of schedule delay cost. Then, this net utility function is applied to build an equilibrium model. Finally, under the assumption of constant marginal activity utility, the properties of equilibrium are analyzed. The results show that, in autonomous driving, the starting and ending time of morning peak and the number of commuters who arrive early and late at workplace are the same as those in manual driving. In automatic driving, however, the departure rate of arriving early at workplace is higher than that of manual driving, while the departure rate of arriving late is just the opposite. In addition, compared with manual driving, the departure time of arriving at workplace on time is earlier and the number of people queuing at the bottleneck is larger in automatic driving. However, the net utility of commuters and the total net utility of system in automatic driving are greater than those in manual driving.
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: The context aware adaptive routing protocol is presented for unicast communication in intermittently connected mobile ad hoc networks (MANETs). The selection of the node is done by the Kalman filter prediction theory and it also makes use of utility functions. The context aware adaptive routing is defined by spray and wait technique, but the time consumption in delivering the message is too high and also the resource wastage is more. In this paper, we describe the spray and focus routing scheme for avoiding the existing problems.
Abstract: This paper presents the development of an event based Discrete Event Simulation (DES) for a recovery algorithm known Backward Recovery Global Preemptive Utility Accrual Scheduling (BR_GPUAS). This algorithm implements the Backward Recovery (BR) mechanism as a fault recovery solution under the existing Time/Utility Function/ Utility Accrual (TUF/UA) scheduling domain for multiprocessor environment. The BR mechanism attempts to take the faulty tasks back to its initial safe state and then proceeds to re-execute the affected section of the faulty tasks to enable recovery. Considering that faults may occur in the components of any system; a fault tolerance system that can nullify the erroneous effect is necessary to be developed. Current TUF/UA scheduling algorithm uses the abortion recovery mechanism and it simply aborts the erroneous task as their fault recovery solution. None of the existing algorithm in TUF/UA scheduling domain in multiprocessor scheduling environment have considered the transient fault and implement the BR mechanism as a fault recovery mechanism to nullify the erroneous effect and solve the recovery problem in this domain. The developed BR_GPUAS simulator has derived the set of parameter, events and performance metrics according to a detailed analysis of the base model. Simulation results revealed that BR_GPUAS algorithm can saved almost 20-30% of the accumulated utilities making it reliable and efficient for the real-time application in the multiprocessor scheduling environment.
Abstract: This paper presents an approach for optimal cyber security decisions to protect instances of a federated Internet of Things (IoT) platform in the cloud. The presented solution implements the repeated Stackelberg Security Game (SSG) and a model called Stochastic Human behaviour model with AttRactiveness and Probability weighting (SHARP). SHARP employs the Subjective Utility Quantal Response (SUQR) for formulating a subjective utility function, which is based on the evaluations of alternative solutions during decision-making. We augment the repeated SSG (including SHARP and SUQR) with a reinforced learning algorithm called Naïve Q-Learning. Naïve Q-Learning belongs to the category of active and model-free Machine Learning (ML) techniques in which the agent (either the defender or the attacker) attempts to find an optimal security solution. In this way, we combine GT and ML algorithms for discovering optimal cyber security policies. The proposed security optimization components will be validated in a collaborative cloud platform that is based on the Industrial Internet Reference Architecture (IIRA) and its recently published security model.
Abstract: This paper highlights some of the normative issues that might result by setting independent thresholds in risk analyses and particularly with safety regions. A second objective is to explain how such regions can be specified appropriately in a meaningful way. We start with a review of the importance of setting deterministic trade-offs among target requirements. We then show how to determine safety regions for risk analysis appropriately using utility functions.
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: Construction projects are information intensive in
nature and involve many activities that are related to each other.
Wireless technologies can be used to improve the accuracy and
timeliness of data collected from construction sites and shares it with
appropriate parties. Nonetheless, the construction industry tends to be
conservative and shows hesitation to adopt new technologies. A main
concern for owners, contractors or any person in charge on a job site
is the cost of the technology in question. Wireless technologies are
not cheap. There are a lot of expenses to be taken into consideration,
and a study should be completed to make sure that the importance
and savings resulting from the usage of this technology is worth the
expenses. This research attempts to assess the effectiveness of using
the appropriate wireless technologies based on criteria such as
performance, reliability, and risk. The assessment is based on a utility
function model that breaks down the selection issue into alternatives
attribute. Then the attributes are assigned weights and single
attributes are measured. Finally, single attribute are combined to
develop one single aggregate utility index for each alternative.
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: Cross layer optimization based on utility functions has
been recently studied extensively, meanwhile, numerous types of
utility functions have been examined in the corresponding literature.
However, a major drawback is that most utility functions take a fixed
mathematical form or are based on simple combining, which can
not fully exploit available information. In this paper, we formulate a
framework of cross layer optimization based on Adaptively Weighted
Utility Functions (AWUF) for fairness balancing in OFDMA networks.
Under this framework, a two-step allocation algorithm is
provided as a sub-optimal solution, whose control parameters can be
updated in real-time to accommodate instantaneous QoS constrains.
The simulation results show that the proposed algorithm achieves
high throughput while balancing the fairness among multiple users.
Abstract: This paper presents an interval-based multi-attribute
decision making (MADM) approach in support of the decision
process with imprecise information. The proposed decision
methodology is based on the model of linear additive utility function
but extends the problem formulation with the measure of composite
utility variance. A sample study concerning with the evaluation of
electric generation expansion strategies is provided showing how the
imprecise data may affect the choice toward the best solution and
how a set of alternatives, acceptable to the decision maker (DM),
may be identified with certain confidence.
Abstract: We propose a multi-agent based utilitarian approach
to model and understand information flows in social networks that
lead to Pareto optimal informational exchanges. We model the
individual expected utility function of the agents to reflect the net
value of information received. We show how this model, adapted
from a theorem by Karl Borch dealing with an actuarial Risk
Exchange concept in the Insurance industry, can be used for social
network analysis. We develop a utilitarian framework that allows us
to interpret Pareto optimal exchanges of value as potential
information flows, while achieving a maximization of a sum of
expected utilities of information of the group of agents. We examine
some interesting conditions on the utility function under which the
flows are optimal. We illustrate the promise of this new approach to
attach economic value to information in networks with a synthetic
example.
Abstract: Influence diagrams (IDs) are one of the most commonly used graphical decision models for reasoning under uncertainty. The quantification of IDs which consists in defining conditional probabilities for chance nodes and utility functions for value nodes is not always obvious. In fact, decision makers cannot always provide exact numerical values and in some cases, it is more easier for them to specify qualitative preference orders. This work proposes an adaptation of standard IDs to the qualitative framework based on possibility theory.