English
Related papers

Related papers: The Multinomial Allocation Model and the Random Bo…

200 papers

We extend Bobkov and Chistyakov's (2015) upper bounds on concentration functions of sums of independent random variables to a multivariate entropic setting. The approach is based on pointwise estimates on densities of sums of independent…

Probability · Mathematics 2026-03-05 James Melbourne , Tomasz Tkocz , Katarzyna Wyczesany

One can often encounter claims that classical (Kolmogorovian) probability theory cannot handle, or even is contradicted by, certain empirical findings or substantive theories. This note joins several previous attempts to explain that these…

Probability · Mathematics 2019-01-24 Ehtibar N. Dzhafarov , Maria Kon

We study the Shapley value in weighted voting games. The Shapley value has been used as an index for measuring the power of individual agents in decision-making bodies and political organizations, where decisions are made by a majority vote…

Computer Science and Game Theory · Computer Science 2014-08-05 Joel Oren , Yuval Filmus , Yair Zick , Yoram Bachrach

Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…

Computer Science and Game Theory · Computer Science 2009-04-17 Patrick Briest , Shuchi Chawla , Robert Kleinberg , S. Matthew Weinberg

Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…

Probability · Mathematics 2026-03-03 Bart Jacobs

We consider a system of weak* closed sets of finite-dimensional distributions. We show that a corresponding system of random variables can be defined on a probability space with a probability measure determined up to some set of measures,…

Probability · Mathematics 2016-11-02 Victor Ivanenko , Illia Pasichnichenko

We show that the Newton polytope of a polynomial has a strong impact on the distribution of its mass and zeros. The basic theme is that Newton polytopes determine allowed and forbidden regions for these distributions. We equip the space of…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

Consider a model of $N$ independent, increasing $\mathbb{N}_0$-valued processes, with random, independent waiting times between jumps. It is known that there is either an emergent `leader', in which a single process possesses the maximal…

Probability · Mathematics 2025-10-09 Johannes Bäumler , Tejas Iyer

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…

Probability · Mathematics 2007-05-23 Larry Goldstein , Gesine Reinert

The sum of $n$ {non-independent} Bernoulli random variables could be modeled in several different ways. One of these is the Multiplicative Binomial Distribution (MBD), introduced by Altham (1978) and revised by Lovison (1998). In this work,…

Statistics Theory · Mathematics 2018-02-26 Francesca Fortunato

We introduce the Hilbert-Galton board as a variant of the classical Galton board. Balls fall into a row of bins at a rate depending on the bin, and at random times, each bin gets shifted one unit to the right and an empty bin is added to…

Probability · Mathematics 2018-07-24 Arvind Ayyer , Sanjay Ramassamy

We study a higher-dimensional 'balls-into-bins' problem. An infinite sequence of i.i.d. random vectors is revealed to us one vector at a time, and we are required to partition these vectors into a fixed number of bins in such a way as to…

Probability · Mathematics 2018-03-13 Juhan Aru , Bhargav Narayanan , Alex Scott , Ramarathnam Venkatesan

Traditional Bayesian random partition models assume that the size of each cluster grows linearly with the number of data points. While this is appealing for some applications, this assumption is not appropriate for other tasks such as…

Methodology · Statistics 2020-04-07 Brenda Betancourt , Giacomo Zanella , Rebecca C. Steorts

This paper addresses the task allocation problem for multi-robot systems. The main issue with the task allocation problem is inherent complexity that makes finding an optimal solution within a reasonable time almost impossible. To hand the…

Multiagent Systems · Computer Science 2019-01-11 Hyo-Sang Shin , Teng Li , Pau Segui-Gasco

A discrete-time stochastic process derived from a model of basketball is used to generalize any discrete distribution. The generalized distributions can have one or two more parameters than the parent distribution. Those derived from…

Applications · Statistics 2020-06-25 Rose Baker

The stable allocation problem is one of the broadest extensions of the well-known stable marriage problem. In an allocation problem, edges of a bipartite graph have capacities and vertices have quotas to fill. Here we investigate the case…

Discrete Mathematics · Computer Science 2014-07-14 Agnes Cseh , Martin Skutella

We consider the allocation problem in which $m \leq (1-\epsilon) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin…

Data Structures and Algorithms · Computer Science 2017-08-24 Alan Frieze , Samantha Petti

We examine the distributions of non-commutative polynomials of non-atomic, freely independent random variables. In particular, we obtain an analogue of the Strong Atiyah Conjecture for free groups thus proving that the measure of each atom…

Operator Algebras · Mathematics 2015-09-03 Dimitri Shlyakhtenko , Paul Skoufranis

The consideration of nonstandard models of the real numbers and the definition of a qualitative ordering on those models provides a generalization of the principle of maximization of expected utility. It enables the decider to assign…

Computer Science and Game Theory · Computer Science 2007-05-23 Daniel Lehmann

We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning…

Computer Science and Game Theory · Computer Science 2017-11-20 Piotr Faliszewski , Arkadii Slinko , Nimrod Talmon
‹ Prev 1 8 9 10 Next ›