Approximating a function by choosing a covering of its domain and k points from its range

DOI10.1016/0885-064X(88)90026-XzbMath0645.65009MaRDI QIDQ1103320

Leonid Hurwicz, Thomas Marschak

Publication date: 1988

Published in: Journal of Complexity (Search for Journal in Brave)

zbMATH Keywords

cellsoutcomeclosest-to-midvalue functionequal-error conditions

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items

Network mechanisms, informational efficiency, and hierarchies

Cites Work

• Discrete allocation mechanisms: Dimensional requirements for resource- allocation mechanisms when desired outcomes are unbounded
• Unnamed Item