Serving in the Dark should be done Non-Uniformly

DOI10.1007/978-3-662-47672-7_8zbMath1440.68322OpenAlexW961489624MaRDI QIDQ3448776

Ilan Reuven Cohen, Yossi Azar

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47672-7_8

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Auctions, bargaining, bidding and selling, and other market models (91B26) Randomized algorithms (68W20) Probabilistic games; gambling (91A60) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Comparison-based buffer management in QoS switches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic methods for algorithmic discrete mathematics
• The zero-one principle for switching networks
• Multi-processor scheduling to minimize flow time with ε resource augmentation
• Balanced Allocations
• Buffer Overflow Management in QoS Switches
• Scheduling Unrelated Machines by Randomized Rounding
• Prompt Mechanisms for Online Auctions
• Probability and Computing
• The loss of serving in the dark
• Concentration of Measure for the Analysis of Randomized Algorithms
• Optimal oblivious routing in polynomial time

This page was built for publication: Serving in the Dark should be done Non-Uniformly