Simulation of Behavior and Intelligence

Approximation of choice functions with a bounded set of presentations

B. M. Litvakov

Moscow

Abstract: Approximation of choice functions as “good” choice functions, such as simpler or better explored, is discussed.

UDC: 62-505, 65.01


Received: 11.08.1983

 English version: Automation and Remote Control, 1985, 46, 248–252

Bibliographic databases:

• 
•