On weighted balls-into-bins games

DOI10.1016/j.tcs.2008.09.023zbMath1155.68085OpenAlexW2026409515MaRDI QIDQ2378532

Russell Martin, Tom Friedetzky, Petra Berenbrink, Zengjian Hu

Publication date: 8 January 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.09.023

zbMATH Keywords

balls-into-bins gamesrandom resource allocationweighted balls

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (8)

Parallel skyline queries ⋮ SSE and SSD: page-efficient searchable symmetric encryption ⋮ Tight bounds for parallel randomized load balancing ⋮ The VCG Mechanism for Bayesian Scheduling ⋮ Decentralized list scheduling ⋮ Parallel load balancing on constrained client-server topologies ⋮ Dynamic local searchable symmetric encryption ⋮ Weighted oblivious RAM, with applications to searchable symmetric encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Allocating weighted jobs in parallel
• Approximate equilibria and ball fusion
• How asymmetry helps load balancing
• Balanced Allocations
• Balanced Allocations: The Heavily Loaded Case
• STACS 2005
• Inequalities: theory of majorization and its applications

This page was built for publication: On weighted balls-into-bins games