English
Related papers

Related papers: Competition between Discrete Random Variables, wit…

200 papers

Winners-take-all situations introduce an incentive for agents to diversify their behavior, since doing so will result in splitting an eventual price with fewer people. At the same time, when the payoff of a process depends on a parameter…

Computer Science and Game Theory · Computer Science 2019-06-11 Abel Molina

Resource competition is a fundamental interaction in natural communities.However little is known about competition in spatial environments where organisms are able to regulate resource distributions. Here, we analyze the competition of two…

Populations and Evolution · Quantitative Biology 2011-02-24 Alexei B. Ryabov , Bernd Blasius

As wireless communication becomes an ever-more evolving and pervasive part of the existing world, system capacity and Quality of Service (QoS) provisioning are becoming more critically evident. In order to improve system capacity and QoS,…

Networking and Internet Architecture · Computer Science 2015-05-18 Bikramjit Singh

How coperation between self-interested individuals evolve is a crucial problem, both in biology and in social sciences, that is far from being well understood. Evolutionary game theory is a useful approach to this issue. The simplest model…

Cellular Automata and Lattice Gases · Physics 2007-12-21 H. Fort

While records and order statistics of independent and identically distributed (i.i.d.) random variables X_1, ..., X_N are fully understood, much less is known for strongly correlated random variables, which is often the situation…

Statistical Mechanics · Physics 2013-05-06 Gregory Schehr , Satya N. Majumdar

This paper investigates the asymptotic behavior of the Multi-set Allocation Occupancy (MAO) distribution, which models the count vector $X=(X_{=0},\ldots,X_{=T})$ from $T$ independent rounds of sampling without replacement of size $m$ from…

Probability · Mathematics 2026-02-24 Xing-gang Mao

Given a set of several inputs into a system (e.g., independent variables characterizing stimuli) and a set of several stochastically non-independent outputs (e.g., random variables describing different aspects of responses), how can one…

Artificial Intelligence · Computer Science 2011-08-30 Ehtibar N. Dzhafarov , Janne V. Kujala

An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to this probability distribution where $N$ may be…

Statistics Theory · Mathematics 2016-09-29 Anna Ben-Hamou , Stéphane Boucheron , Mesrob I. Ohannessian

A collaborative distributed binary decision problem is considered. Two statisticians are required to declare the correct probability measure of two jointly distributed memoryless process, denoted by $X^n=(X_1,\dots,X_n)$ and…

Information Theory · Computer Science 2016-04-11 Gil Katz , Pablo Piantanida , Merouane Debbah

In wireless networks, the knowledge of nodal distances is essential for several areas such as system configuration, performance analysis and protocol design. In order to evaluate distance distributions in random networks, the underlying…

Information Theory · Computer Science 2012-01-24 Sunil Srinivasa , Martin Haenggi

Let $X_1, \ldots , X_n$ be mutually independent exponential random variables with distinct hazard rates $\lambda_1, \ldots , \lambda_n > 0$ and let $Y_1, \ldots, Y_n$ be a random sample from the exponential distribution with hazard rate…

Probability · Mathematics 2022-02-17 Subhash Kochar

This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…

Probability · Mathematics 2015-09-30 Jim Pitman , Ngoc M. Tran

The inductive size bias coupling technique and Stein's method yield a Berry-Esseen theorem for the number of urns having occupancy $d \ge 2$ when $n$ balls are uniformly distributed over $m$ urns. In particular, there exists a constant $C$…

Probability · Mathematics 2019-04-02 Jay Bartroff , Larry Goldstein

We tackle the problem of partitioning players into groups of fixed size, such as allocating eligible students to shared dormitory rooms. Each student submits preferences over the other individual students. We study several settings, which…

Computer Science and Game Theory · Computer Science 2019-06-21 Ágnes Cseh , Tamás Fleiner , Petra Harján

We study the assignment problem of objects to agents with heterogeneous preferences under distributional constraints. Each agent is associated with a publicly known type and has a private ordinal ranking over objects. We are interested in…

Data Structures and Algorithms · Computer Science 2019-05-02 Itai Ashlagi , Amin Saberi , Ali Shameli

In this work we present and analyze a fluid-mechanical model of competition (scavenging) amongst $N$ liquid droplets (individual competitors). The eventual outcome of this competition depends sensitively on the average resource (volume) per…

Fluid Dynamics · Physics 2019-02-18 Thomas C. Hagen , Paul H. Steen

A simple model for cooperation between "selfish" agents, which play an extended version of the Prisoner's Dilemma(PD) game, in which they use arbitrary payoffs, is presented and studied. A continuous variable, representing the probability…

Condensed Matter · Physics 2009-11-10 H. Fort

Let $(X,Y)\in\mathcal{X}\times \mathcal{Y}$ be a random couple with unknown distribution $P$. Let $\GG$ be a class of measurable functions and $\ell$ a loss function. The problem of statistical learning deals with the estimation of the…

Statistics Theory · Mathematics 2012-07-12 Sébastien Loustau

Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…

Probability · Mathematics 2010-04-08 Steven Lalley , Xinghua Zheng

Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the…

Information Theory · Computer Science 2007-09-04 Andrea Montanari