Mollifiers for games in normal form and the Harsanyi-Selten valuation function

The concepts of disruption and mollifiers ofCharnes/Rousseau/Seiford [1978] for games in characteristic function form are here extended to games in normal form. We show for a large class of games that theHarsanyi-Selten [1959] modification ofvon Neumann /Morgenstern's [1953] construction of a characteristic function for games in normal form, to take better account of “disruption” or “threat” possibilities, yields a constant mollifier. In general, it can be non-superadditive when the von Neumann-Morgenstern function is superadditive, and it also fails to take account of coalitional sizes. Our extended “homomollifier” concept does, and always yields a superadditive constant sum characteristic function.     

Voie d'acces originale a des acetamido-3 amino-4 (IH) pyridones-2 par hydrogenation-rearrangement des nitro-3 amino-4 pyridines

3-Nitro 4-alkyl (or aryl) amino pyridines were converted to 3-acetamido 4-a1ky1 (or aryl) amino (1H) pyridine-Z-ones by a catalytic hydrogenation-rearrangement in acetic acid medium.     

An extremal problem for paths in bipartite graphs

A formula is found for the maximum number of edges in a graph G ? K(a, b) which contains no path P_2l for l > c. A similar formula is found for the maximum number of edges in G ? K(a, b) containing no P_{2l + 1} for l > c. In addition, all extremal graphs are determined.     

A Heuristic Scheduling Algorithm

This paper describes a heuristic algorithm developed to schedule a group of individuals such that every person performs each of the different activities they desire at some point during the time-frame of the schedule and the difference between the exogenously given number of people desired at each available location-activity-period position and those allocated to these positions is minimized. The contribution of the present work is in the formulation of the problem, and the resulting ease with which good solutions to large-scale problems can be generated, rather than in the mechanics of the algorithm itself. The mathematic formulation of the scheduling problem is presented first, and subsequently, the solution strategy is elaborated. Experimental results on some reasonably large problems are also presented.