88,403 research outputs found
Computability and analysis: the legacy of Alan Turing
We discuss the legacy of Alan Turing and his impact on computability and
analysis.Comment: 49 page
Parameterized complexity of machine scheduling: 15 open problems
Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are
fixed-parameter algorithms. To stimulate this thriving research direction, we
propose 15 open questions in this area whose resolution we expect to lead to
the discovery of new approaches and techniques both in scheduling and
parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc
"Rotterdam econometrics": publications of the econometric institute 1956-2005
This paper contains a list of all publications over the period 1956-2005, as reported in the Rotterdam Econometric Institute Reprint series during 1957-2005.
Average Weights and Power in Weighted Voting Games
We investigate a class of weighted voting games for which weights are
randomly distributed over the standard probability simplex. We provide
close-formed formulae for the expectation and density of the distribution of
weight of the -th largest player under the uniform distribution. We analyze
the average voting power of the -th largest player and its dependence on the
quota, obtaining analytical and numerical results for small values of and a
general theorem about the functional form of the relation between the average
Penrose--Banzhaf power index and the quota for the uniform measure on the
simplex. We also analyze the power of a collectivity to act (Coleman efficiency
index) of random weighted voting games, obtaining analytical upper bounds
therefor.Comment: 12 pages, 7 figure
Solution Repair/Recovery in Uncertain Optimization Environment
Operation management problems (such as Production Planning and Scheduling)
are represented and formulated as optimization models. The resolution of such
optimization models leads to solutions which have to be operated in an
organization. However, the conditions under which the optimal solution is
obtained rarely correspond exactly to the conditions under which the solution
will be operated in the organization.Therefore, in most practical contexts, the
computed optimal solution is not anymore optimal under the conditions in which
it is operated. Indeed, it can be "far from optimal" or even not feasible. For
different reasons, we hadn't the possibility to completely re-optimize the
existing solution or plan. As a consequence, it is necessary to look for
"repair solutions", i.e., solutions that have a good behavior with respect to
possible scenarios, or with respect to uncertainty of the parameters of the
model. To tackle the problem, the computed solution should be such that it is
possible to "repair" it through a local re-optimization guided by the user or
through a limited change aiming at minimizing the impact of taking into
consideration the scenarios
- …