The donor problem

Donors often rely on local intermediaries to deliver benefits to target beneficiaries. Each selected recipient observes if the intermediary under-delivers to them, so they serve as natural monitors. However, they may withhold complaints when feeling unentitled or grateful to the intermediary for selecting them. Furthermore, the intermediary may distort selection (e.g. by picking richer recipients who feel less entitled) to reduce complaints. We design an experimental game representing the donor s problem. In one treatment, the intermediary selects recipients. In the other, selection is random - as by an uninformed donor. In our data, random selection dominates delegation of the selection task to the intermediary. Selection distortions are similar, but intermediaries embezzle more when they have selection power and (correctly) expect fewer complaints.

A simple optimised search heuristic for the job-shop scheduling problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Taking "Galton's problem" Seriously : Towards a Theory of Policy Diffusion

This article builds on the recent policy diffusion literature and attempts to overcome one of its major problems, namely the lack of a coherent theoretical framework. The literature defines policy diffusion as a process where policy choices are interdependent, and identifies several diffusion mechanisms that specify the link between the policy choices of the various actors. As these mechanisms are grounded in different theories, theoretical accounts of diffusion currently have little internal coherence. In this article we put forward an expected-utility model of policy change that is able to subsume all the diffusion mechanisms. We argue that the expected utility of a policy depends on both its effectiveness and the payoffs it yields, and we show that the various diffusion mechanisms operate by altering these two parameters. Each mechanism affects one of the two parameters, and does so in distinct ways. To account for aggregate patterns of diffusion, we embed our model in a simple threshold model of diffusion. Given the high complexity of the process that results, strong analytical conclusions on aggregate patterns cannot be drawn without more extensive analysis which is beyond the scope of this article. However, preliminary considerations indicate that a wide range of diffusion processes may exist and that convergence is only one possible outcome.

Dispersal probability distributions and the wave-front speed problem

The speed and width of front solutions to reaction-dispersal models are analyzed both analytically and numerically. We perform our analysis for Laplace and Gaussian distribution kernels, both for delayed and nondelayed models. The results are discussed in terms of the characteristic parameters of the models

Zum Problem der Übersetzung von Gedichten : auch vom Gesichtspunkt des Computers

Abstract

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

Iowa Problem Identification, February 2010

Each year, traffic crashes in the United States result in nearly 300,000 deaths and serious injuries. In 2008 alone, traffic crashes cost the nation an estimated $230 billion, nine times more than the estimated cost of all crime. Highway crashes represent the leading cause of death and disabling injury for persons under age 35. In recognition of this problem, the Congress of the United States enacted national highway safety legislation in 1966, which led to the establishment of the National Highway Traffic Safety Administration (NHTSA). The legislation also provided for federal highway safety monies to be made available to the states with a goal of reducing death and injury on the nation’s roads. Iowa has been very active in the federal-state local highway safety partnership since the mid 1960s.

Alcohol consumption in late adolescence and early adulthood - where is the problem?

Risky single-occasion drinking (RSOD) is more common in late adolescence and early adulthood (approximately between the ages of 16 and 30) than in any other period in life. This is also the age when young people in Switzerland and many other European countries are legally allowed to buy and drink alcohol, but they usually do not yet have adult responsibilities. This paper reviews evidence from the international literature and provides examples of studies conducted in Switzerland demonstrating that (a) RSOD is by far most prevalent on Saturday evenings followed by Friday evenings, usually because young people go out and do not have any work or study responsibilities the next day; (b) RSOD results from drinking in private before going out ("predrinking") and accelerating the pace of drinking (i.e. increasing the number of drinks consumed per hour); (c) RSOD is often not accidental but purposeful,. to seek excitement, to have fun and to feel the effects of alcohol; (d) RSOD occurs predominantly outside the home, mostly in bars, pubs, discos or at special events and festivals; (e) RSOD often results in intended and unintended injuries and other acute consequences, which are leading risk factors for mortality and morbidity in this age group. Effective prevention strategies should include attempts to reduce opportunities to engage in heavy drinking as well as strategies to reduce its harmful consequences.

Report on a special investigation of the Eastern Iowa Center for Problem Gambling for the period May 1, 2007 through April 30, 2009

Report on a special investigation of the Eastern Iowa Center for Problem Gambling for the period May 1, 2007 through April 30, 2009