Narrow search
Showing 1 - 10 of 17,036
Cover Image
Solving Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2009
prove this we use a simplicial algorithm that terminates with a zero point within a finite number of iterations. The …
Persistent link: https://www.econbiz.de/10010325776
Cover Image
Computing Integral Solutions of Complementarity Problems
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 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/10010325585
Cover Image
Combinatorial Integer Labeling Theorems on Finite Sets with an Application to Discrete Systems of Nonlinear Equations
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2007
Tucker's well-known combinatorial lemma states that for any given symmetric triangulation of the n-dimensional unit cube and for any integer labeling that assigns to each vertex of the triangulation a label from the set {1,2,...n,-1,-2,....-n} with the property that antipodal vertices on the...
Persistent link: https://www.econbiz.de/10010325373
Cover Image
Solving Discrete Zero Point Problems
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2004
AbstractSee document.
Persistent link: https://www.econbiz.de/10010325312
Cover Image
Solving Discrete Zero Point Problems with Vector Labeling
van der Laan, Gerard; Talman, Dolf; Yang, Zaifu - 2005
proof using a combinatorial argument based on a simplicial algorithm with vector labeling and lexicographic linear … programming pivot steps. We also adept the algorithm to prove the existence of a solution to the discrete complementarity problem. …
Persistent link: https://www.econbiz.de/10010325314
Cover Image
Optimal resource allocation in multiclass networks
Naumov, Valeriy; Martikainen, Olli - 2011
In this paper, we study resource allocation in multiclass networks having several types of flexible servers and general constraints on the number of servers at each station. Each job class is characterized by the station where the job is processed and by the amount of work allocated to that...
Persistent link: https://www.econbiz.de/10010326889
Cover Image
Method for throughput maximization of multiclass networks with flexible servers
Naumov, Valeriy; Martikainen, Olli - 2011
In this paper, we study the throughput of multiclass networks featuring several types of flexible servers as well as general constraints both on the number of servers having the same skills and on the number of servers allowed at each station. Each job class is characterized by its processing...
Persistent link: https://www.econbiz.de/10010326896
Cover Image
Combining Top-Down and Bottom-up in Energy Policy Analysis: A Decomposition Approach
Rutherford, Thomas F.; Böhringer, Christoph - 2006
The formulation of market equilibrium problems as mixed complementarity problems (MCP) permits integration of bottom-up programming models of the energy system into top-down general equilibrium models of the overall economy. Despite the coherence and logical appeal of the integrated MCP...
Persistent link: https://www.econbiz.de/10010297515
Cover Image
The Unique-lowest Sealed-bid Auction
Houba, Harold; van der Laan, Dinard; Veldhuizen, Dirk - 2008
Unique-lowest sealed-bid auctions are auctions in which participation is endogenous and the winning bid is the lowest bid among all unique bids. Such auctions admit very many Nash equilibria (NEs) in pure and mixed strategies. The two-bidders' auction is similar to the Hawk-Dove game, which...
Persistent link: https://www.econbiz.de/10010325775
Cover Image
Finding all minimal CURB sets
Klimm, Max; Weibull, Jörgen W. - 2009
replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). …
Persistent link: https://www.econbiz.de/10010281178