Device-to-Device (D2D) communication has recently emerged as a promising technology to improve the capacity and coverage of cellular systems. To successfully implement D2D communications underlaying a cellular network, resource allocation for D2D links plays a critical role. While most of prior resource allocation mechanisms for D2D communications have focused on interference within a single-ce...

Moving assets through a transportation network is a crucial challenge in hostile environments such as future battlefields where malicious adversaries have strong incentives to attack vulnerable patrols and supply convoys. Intelligent agents must balance network costs with the harm that can be inflicted by adversaries who are in turn acting rationally to maximize harm while trading off against t...

This note addresses scenarios of buyers purchasing rate along paths in a nonhierarchical communication network. A sum bid game is proposed in which each buyer submits a bid, also equal to a payment, and the network allocates rate in a weighted proportionally fair fashion, with the bids as the weights. This is in contrast to an itemized bid game, considered recently by Johari and Tsitsiklis, und...

Background and objective: The location of facilities is of great importance in healthcare and is of interest to researchers due to its importance. In this regard, a large proportion of classic location-allocation models concentrate on solving problems in an exclusive environment (non-competitive), but this assumption is rarely true in reality. Methods: At...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence a...

This paper addresses the control of a team of autonomous agents pursuing a smart evader in a nonaccurately mapped terrain. By describing this problem as a partial information Markov game, we are able to integrate map-learning and pursuit. We propose receding horizon control policies, in which the pursuers and the evader try to respectively maximize and minimize the probability of capture at the...

For generations programmed mammal aging was widely thought to be theoretically impossible. However, new evolutionary mechanics concepts have led to renewed interest in programmed aging resulting in a schism between programmed and non-programmed proponents. This article argues that this lack of consensus is damaging medical research and therefore steps should be taken to pro-actively resolve the...

This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\subset N$, and a second player, the follower, selects a solution $A\subseteq N$ in order to utilize a bounded...

We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We complement the known EXP-hardness of computing the exact value of a succinct zero-sum game by several results on approximating the value. (1) We prove that approximating the value of a succinct zero-sum game to within an add...

Many companies producing durable products, profit more from spares than the base parts. In a competitive and uncertain aftermarket, an Original Equipment Manufacturer (OEM) can benefit from Game Theory to manage spare parts inventories. We study the spare parts inventory game as an N-person non-zero-sum single-shot game where players play simultaneously. The game is restricted to a two-player (...