Some extremal problems arising from discrete control processes

DOI10.1007/BF02125896MaRDI QIDQ913685zbMATH OpenOpenAlexFDO

Authors David Lichtenstein, Nathan Linial, Michael Saks

Publication date 1989

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02125896

zbMATH Keywords

bit extractioncollective coin flippingdiscrete control processesimperfect random sources

Mathematics Subject Classification ID

Game theory (91A99) Discrete-time control/observation systems (93C55) Optimal stochastic control (93E20)

Recommendations

• scientific article; zbMATH DE number 4174787
• On extremal solutions to stochastic control problems
• On controllability and extremality for discrete delay inclusions
• scientific article; zbMATH DE number 1122187
• On Controllability And Maximum Principle for Discrete Inclusions^∗∗A part of the paper was written while the first author was visiting the laboratory of Prof.S.Suzuki,Department of Mechanical Engineering, Sophia University,Tokyo,J
• scientific article; zbMATH DE number 1356132
• On extremal solutions to stochastic control problems. II
• scientific article; zbMATH DE number 3878823
• A measure-theoretical approach for solving discrete optimal control problems

Cites work

• Generating quasi-random sequences from semi-random sources
• scientific article; zbMATH DE number 3914379 (Why is no real title available?)
• scientific article; zbMATH DE number 4106654 (Why is no real title available?)
• scientific article; zbMATH DE number 3636041 (Why is no real title available?)
• Optimal numberings and isoperimetric problems on graphs
• Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
• Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity

Cited in

(18)

• Extracting randomness: A survey and new constructions
• Biased random walks
• Simulating BPP using a general weak random source
• Extracting randomness from extractor-dependent sources
• How to extract useful randomness from unreliable sources
• Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
• Polynomial-time targeted attacks on coin tossing for any number of corruptions
• scientific article; zbMATH DE number 4174787 (Why is no real title available?)
• ON THE EXISTENCE OF A SOLUTION IN A PROBLEM OF CONTROLLING A COUNTING PROCESS
• Adaptively secure coin-flipping, revisited
• Privacy with Imperfect Randomness
• scientific article; zbMATH DE number 1356132 (Why is no real title available?)
• A lower bound for adaptively-secure collective coin-flipping protocols
• Deterministic extractors for small-space sources
• On secret sharing, randomness, and random-less reductions for secret sharing
• Can adversarially robust learning leverage computational hardness?
• A tight lower bound on adaptively secure full-information coin flip
• A lower bound for adaptively-secure collective coin flipping protocols

This page was built for publication: Some extremal problems arising from discrete control processes

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