Related papers: Competition between Discrete Random Variables, wit…
In this paper, we study proximal type dynamics in the context of noncooperative multi-agent network games. These dynamics arise in different applications, since they describe distributed decision making in multi-agent networks, e.g., in…
We consider normal-form games with $n$ players and two strategies for each player, where the payoffs are i.i.d. random variables with some distribution $F$ and we consider issues related to the pure equilibria in the game as the number of…
Inferring the causal structure of a set of random variables from a finite sample of the joint distribution is an important problem in science. Recently, methods using additive noise models have been suggested to approach the case of…
Practical wireless networks are finite, and hence non-stationary with nodes typically non-homo-geneously deployed over the area. This leads to a location-dependent performance and to boundary effects which are both often neglected in…
Let $T$ be a $C^{1}$ competitive map on a rectangular region $R\subset \mathbb{R}^{2}$. The main results of this paper give conditions which guarantee the existence of an invariant curve $C$, which is the graph of a continuous increasing…
The sequential sampling of populations with unequal probabilities and with replacement in a closed population is a recurrent problem in ecology and evolution. Many of these questions can be reformulated as urn problems, often as special…
In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of…
A \emph{fair competition}, based on the concept of envy-freeness, is a non-eliminating competition where each contestant (team or individual player) may not play against all other contestants, but the total difficulty for each contestant is…
We study a particular example of a recursive distributional equation (RDE) on the unit interval. We identify all invariant distributions, the corresponding "basins of attraction" and address the issue of endogeny for the associated…
In this paper we examine the problem of inference in Bayesian Networks with discrete random variables that have very large or even unbounded domains. For example, in a domain where we are trying to identify a person, we may have variables…
Probabilistic conditioning is concerned with the identification of a distribution of a random variable $X$ given a random variable $Y$. It is a cornerstone of scientific and engineering applications where modeling uncertainty is key. This…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…
It is common to be interested in rankings or order relationships among entities. In complex settings where one does not directly measure a univariate statistic upon which to base ranks, such inferences typically rely on statistical models…
This Ph.D. thesis concerns the version of the classical coupon collector's problem, when a collector samples with replacement a set of $n\ge 2$ distinct coupons so that at each time any one of the $n$ coupons is drawn with the same…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…
We study a class of games which model the competition among agents to access some service provided by distributed service units and which exhibit congestion and frustration phenomena when service units have limited capacity. We propose a…
Consider a weighted branching process generated by the lengths of intervals obtained by stick-breaking of unit length (a.k.a. the residual allocation model) and associate with each weight a `box'. Given the weights `balls' are thrown…
The time which a diffusing particle spends in a certain region of space is known as the occupation time, or the residence time. Recently the joint occupation time statistics of an ensemble of non-interacting particles was addressed using…
We consider the combinatorial problem where $p$ players aim to a complete set of $N$ different types of items (species) which are uniformly distributed. Let the random variables $T_{N(i)},\,\,i=1,2,\cdots,p$ denoting the number of trials…