Similar Search Results

Solving House Allocation Problems with Risk-Averse Agents

Andersson, Tommy; Andersson, Christer - In: Computational Economics 33 (2009) 4, pp. 389-401

Persistent link: https://www.econbiz.de/10005542287

Block Kalman filtering for large-scale DSGE models

Strid, Ingvar; Walentin, Karl - Sveriges Riksbank - 2008

the operations of the prediction step of the algorithm. It is argued that block filtering is the only viable serial …

Persistent link: https://www.econbiz.de/10005423749

Modeling Algorithms for Dynamical Systems

Gallo, Crescenzio - Dipartimento di Scienze Economiche, Matematiche e … - 2009

Technological development and explosion of computing tools allow today to make best use of modeling methodologies that in the past were not able to perform the calculations necessary for the mathematical representation of a complex system. This paper illustrates some directions in literature...

Persistent link: https://www.econbiz.de/10005434776

Integrated Chance Constraints: Reduced Forms and an Algorithm

Haneveld, Willem; Vlerk, Maarten - In: Computational Management Science 3 (2006) 4, pp. 245-269

Persistent link: https://www.econbiz.de/10005370537

Calculus of Bargaining Solution on Boolean Tables

Mullat, Joseph E. - EconWPA - 2001

adequate calculus. By adequate calculus we understand an algorithm that can lead us to the result within reasonable timetable …

Persistent link: https://www.econbiz.de/10005407621

SIMANN: A Global Optimization Algorithm using Simulated Annealing

Goffe, William - In: Studies in Nonlinear Dynamics & Econometrics 1 (1996) 3, pp. 169-176

This paper describes SIMANN, a Fortran and GAUSS implementation of the simulated annealing algorithm. The Fortran code … optimization routines for difficult optimization problems. This paper compares SIMANN to the DFP algorithm on another optimization …

Persistent link: https://www.econbiz.de/10005459067

A Centered Projective Algorithm for Linear Programming

Todd, Michael J.; Ye, Yinyu - Cowles Foundation for Research in Economics, Yale University - 1988

We describe a projective algorithm for linear programming that shares features with Karmarkar's projective algorithm …

Persistent link: https://www.econbiz.de/10005463880

ALGORITHM COMPARING BINARY STRING PROBABILITIES IN COMPLEX STOCHASTIC BOOLEAN SYSTEMS USING INTRINSIC ORDER GRAPH

GONZÁLEZ, LUIS - In: Advances in Complex Systems (ACS) 10 (2007) su, pp. 111-143

binary n-tuple u, this paper presents a new, simple algorithm enabling rapid, elegant determination of all the binary n …-tuples v with occurrence probabilities less than or equal to (greater than or equal to) Pr{u}. This algorithm is closely …

Persistent link: https://www.econbiz.de/10004977711

Explorations into the Visualization of Policy Networks

Brandes, Ulrik; Kenis, Patrick; Raab, Jörg; Schneider, … - In: Journal of Theoretical Politics 11 (1999) 1, pp. 75-106

Visualization is an important aspect of both exploration and communication of categorical as well as relational data. Graphical displays of policy networks are particularly attractive, since they enable authors to display in a compact way the relevant actors in a network, how they are related to...

Persistent link: https://www.econbiz.de/10011135461

Problem Reduction in Set Partitioning Problems

Fleuren, Hein; van Krieken, M.G.C.; Peeters, M.J.P. - Tilburg University, Center for Economic Research - 2003

partitioning problems. These techniques can be applied in any solution algorithm for set partitioning problems. Besides a short …

Persistent link: https://www.econbiz.de/10011096214