Sciweavers

48 search results - page 7 / 10
» Bounded Rationality in Newsvendor Models
Sort
View
STOC
1993
ACM
141views Algorithms» more  STOC 1993»
13 years 11 months ago
Bounds for the computational power and learning complexity of analog neural nets
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
Wolfgang Maass
MSS
2008
IEEE
112views Hardware» more  MSS 2008»
13 years 7 months ago
Axiomatization of stochastic models for choice under uncertainty
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...
John K. Dagsvik
ATAL
2009
Springer
14 years 2 months ago
Perspectives and challenges of agent-based simulation as a tool for economics and other social sciences
This paper argues that the agent-based simulation approach is just the one appropriate to the social sciences (including economics). Although there were many predecessor approache...
Klaus G. Troitzsch
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 28 days ago
Subquadratic Algorithms for 3SUM
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models. On a standard word RAM with w-bit words, we obtain a running time of O(n2 / max{ w lg2 w , ...
Ilya Baran, Erik D. Demaine, Mihai Patrascu
TARK
2007
Springer
14 years 1 months ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh