An optimal strategy for a conflict resolution problem

DOI10.1016/0167-6911(86)90048-4MaRDI QIDQ1079450zbMATH OpenOpenAlexFDO

Authors V. Anantharam, Pravin Varaiya

Publication date 1986

Published in Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6911(86)90048-4

zbMATH Keywords

optimal strategyconflict resolutionbinary questioningdesign of multiple access protocolsoptimum sequence of questions

Mathematics Subject Classification ID

Decision theory (91B06)

Recommendations

• Conflict resolution in a multiple access channel
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• Packet output time for a strategy which knows the multiplicities of occurring conflicts
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• Estimating the multiplicities of conflicts to speed their resolution in multiple access channels

Cites work

• On Partitioning a Sample With Binary-Type Questions in Lieu of Collecting Observations

Cited in

(1)

• scientific article; zbMATH DE number 465390 (Why is no real title available?)

This page was built for publication: An optimal strategy for a conflict resolution problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079450)