Results 11 to 20 of about 1,087,668 (215)
Balanced allocation with succinct representation
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 2010 Motivated by applications in guaranteed delivery in computational advertising, we consider the general problem of balanced allocation in a bipartite supply-demand setting. Our formulation captures the notion of deviation from being balanced by a convex penalty function.
Saeed Alaei +3 more
openaire +2 more sources
Balanced allocation on hypergraphs
Journal of Computer and System Sciences, 2023 We consider a variation of balls-into-bins which randomly allocates $m$ balls into $n$ bins. Following Godfrey's model (SODA, 2008), we assume that each ball $t$, $1\le t\le m$, comes with a hypergraph $\mathcal{H}^{(t)}=\{B_1,B_2,\ldots,B_{s_t}\}$, and each edge $B\in\mathcal{H}^{(t)}$ contains at least a logarithmic number of bins.
Catherine S. Greenhill +2 more
openaire +4 more sources
The power of thinning in balanced allocation [PDF]
Electronic Communications in Probability, 2021 Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new independent uniformly random bin.
Ohad N. Feldheim, Ori Gurel-Gurevich
openaire +2 more sources
Balanced allocation on graphs [PDF]
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006 In this paper, we study the two choice balls and bins process when balls are not allowed to choose any two random bins, but only bins that are connected by an edge in an underlying graph. We show that for $n$ balls and $n$ bins, if the graph is almost regular with degree $n^ε$, where $ε$ is not too small, the previous bounds on the maximum load ...
Krishnaram Kenthapadi, Rina Panigrahy
openaire +4 more sources
Balanced Allocations in Batches
Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures, 2022 47 pages, 8 Figures, 1 ...
Dimitrios Los, Thomas Sauerwald
openaire +4 more sources
CoRR, 2021 We introduce balancedness a fairness axiom in house allocation problems. It requires a mechanism to assign the top choice, the second top choice, and so on, on the same number of profiles for each agent. This axiom guarantees equal treatment of all agents at the stage in which the mechanism is announced when all preference profiles are equally likely ...
Xinghua Long, Rodrigo A. Velez
openaire +2 more sources
Balanced Allocations with the Choice of Noise
Journal of the ACM, 2022 We consider the allocation of m balls (jobs) into n bins (servers). In the standard Two-Choice process, at each step t =1,2,... ,m we first sample two randomly chosen bins, compare their two loads and then place a ball in
Dimitrios Los, Thomas Sauerwald
openaire +4 more sources
Balanced Allocation: Patience is not a Virtue [PDF]
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2015 26 pages, preliminary version accepted at SODA ...
John Augustine 0001 +3 more
openaire +2 more sources
Risk allocation under liquidity constraints [PDF]
, 2013 Risk allocation games are cooperative games that are used to attribute the risk of a financial entity to its divisions. In this paper, we extend the literature on risk allocation games by incorporating liquidity considerations.
Herings, P. Jean-Jacques +3 more
core +3 more sources
Resource balancing control allocation [PDF]
Proceedings of the 2010 American Control Conference, 2010 Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l 1 or l 2 norms of the tracking error and of the control effort.
Susan A. Frost, Marc Bodson
openaire +1 more source