Optimal policies to obtain the most join results

DOI10.1007/s10959-007-0063-4zbMath1121.68038OpenAlexW2039389988MaRDI QIDQ2641425

Nariankadu D. Shyamalkumar, Ramon Lawrence, Ralph P. Russo

Publication date: 20 August 2007

Published in: Journal of Theoretical Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10959-007-0063-4

zbMATH Keywords

CouplingOptimal strategiesGreedy policySequential strategies

Mathematics Subject Classification ID

Database theory (68P15) Combinatorial probability (60C05) Exchangeability for stochastic processes (60G09)

Related Items (1)

Reading policies for joins: an asymptotic analysis

Cites Work

• Finite exchangeable sequences
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal policies to obtain the most join results