Similar Search Results

Computation of the Nucleolus for a Class of Disjunctive Games with a Permission Structure

Brink, René van den; Katsev, Ilya; Laan, Gerard van der - Tinbergen Institute - 2008

provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

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

Computing Integral Solutions of Complementarity Problems

Laan, Gerard van der; Talman, Dolf; Yang, Zaifu - Tinbergen Institute - 2005

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

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

Research on tax revenue increasing faster than GDP increasing based upon industry structure

Tang, Dengshan; Wu, Hong - In: Frontiers of Economics in China 4 (2009) 2, pp. 192-208

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

Stable Sets in Three Agent Pillage Games

Kerber, Manfred; Rowat, Colin - Department of Economics, University of Birmingham - 2009

Jordan [2006, “Pillage and property”, JET] characterises stable sets for three special cases of ‘pillage games’. For anonymous, three agent pillage games we show that: when the core is non-empty, it must take one of five forms; all such pillage games with an empty core represent the same...

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

Computing equilibrium in a matching market with a Walrasian mechanism

Kamecke, Ulrich - University of Bonn, Germany - 1988

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

A Practical Method for Explicitly Modeling Quotas and Other Complementarities

Harrison, W. Jill; Horridge, Mark; Pearson, K.R.; … - Centre of Policy Studies and Impact Project (COPS), … - 2002

divide exogenous changes into several smaller steps. We interpret this procedure as a path-following algorithm. If all …

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

A Fenchel Duality Aspect of Iterative I-Projection Procedures

Bhattacharya, Bhaskar; Dykstra, Richard - In: Annals of the Institute of Statistical Mathematics 49 (1997) 3, pp. 435-446

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

Egalitarianism in convex fuzzy games

Branzei, R.; Dimitrov, D.; Tijs, S. - Institut für Mathematische Wirtschaftsforschung, … - 2002

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

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