Showing 761 - 770 of 843
algorithms are more efficient. We introduce the rejection free (or continuous time) algorithm and describe in details an …
Persistent link: https://www.econbiz.de/10011077842
We study two-sided ("marriage") and general pairing ("roommate") problems. We introduce "sequences," lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition,...
Persistent link: https://www.econbiz.de/10011079258
The use of agent-based modeling in economics is a step forward enabling a more realistic description of the complex interactions and behaviors occurring in the economic environment. Although it offers increased realism, especially in describing how local characteristics generate global patterns,...
Persistent link: https://www.econbiz.de/10011038689
neighbors of each other. We propose two algorithms, Conf and Throw, that take triangle and single edge degree sequences as input …
Persistent link: https://www.econbiz.de/10011060396
In industrial experiments on both design (control) factors and noise factors aimed at improving the quality of manufactured products, designs are needed which afford independent estimation of all design×noise interactions in as few runs as possible, while allowing aliasing between those...
Persistent link: https://www.econbiz.de/10005278947
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier) and computability. For each such class, we either show...
Persistent link: https://www.econbiz.de/10005626817
This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of...
Persistent link: https://www.econbiz.de/10005118600
planning horizon. Furthermore, for fixed-charge and nonspeculative costs, we provide O(Tlog T) and O(T) algorithms …
Persistent link: https://www.econbiz.de/10011240733
<Para ID="Par1">Sometimes, the feasible set of an optimization problem that one aims to solve using a Nonlinear Programming algorithm is empty. In this case, two characteristics of the algorithm are desirable. On the one hand, the algorithm should converge to a minimizer of some infeasibility measure. On the...</para>
Persistent link: https://www.econbiz.de/10011241277
This paper analyzes the problem of selling a number of indivisible items to a set of unitdemand bidders. An ascending auction mechanism called the Excess Demand Ascending Auction (EDAA) is defined. The main results demonstrate that EDAA terminates in a finite number of iterations and that the...
Persistent link: https://www.econbiz.de/10011091190