This paper presents and compares three heuristics for the combinatorial auctionproblem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulatedannealing (SA), and a genetic algorithm (GA) approach are developedwhich use the combinatorial auction process to an allocation with...

We consider some asymptotic distribution theory for M-estimators of the parameters of a linear model whose errors are non-negative; these estimators are the solutions of constrained optimization problems and their asymptotic theory is non-standard. Under weak conditions on the distribution of the...

We investigate the estimation of models of dynamic discrete-choice games of incomplete information, formulating the maximum-likelihood estimation exercise as a constrained optimization problem that can be solved using state-of-the-art constrained optimization solvers. Under the assumption that...

Point allocation experiments are widely used in the social sciences. In these experiments, survey respondents distribute a fixed total number of points across a fixed number of alternatives. This paper reviews the different perspectives in the literature about what respondents do when they...

Insurance companies and banks regularly have to face stress tests performed by regulatory instances. To model their investment decision problems that includes stress scenarios, we propose the worst-case portfolio approach. Thus, the resulting optimal portfolios are already stress test prone by...

Since the beginnings of modern economics, economists sought to emulate the revolution in physics initiated by Newton's 'Principia' (1687). Concepts from mechanics have influenced economic models both in terms of methodology and content. The aim of this theoretical paper is to put forward a novel...