Stochastic programming with simple integer recourse

Stochastic integer programs are notoriously difficult. Very few properties are known and solution algorithms are very scarce. In this paper, we introduce the class of stochastic programs with simple integer recourse, a natural extension of the simple recourse case extensively studied in stochastic continuous programs.Analytical as well as computational properties of the expected recourse function of simple integer recourse problems are studied. This includes sharp bounds on this function and the study of the convex hull. Finally, a finite termination algorithm is obtained that solves two classes of stochastic simple integer recourse problems.Supported by the National Operations Research Network in the Netherlands (LNMB).     

Art galleries with guards of uniform range of vision

We are given an art gallery represented by a simple polygon with n sides and an angle (0°,360°]. How many guards of range of vision are required to monitor every point of the polygon in the worst case? After recent results on upper bounds of this problem, we prove new lower bounds for all 0°<<180°. Several lower bounds meet the best known upper bounds, and we expect our lower bounds to be best possible.

Surprisingly, it turns out that n/3 180°-guards are always enough to monitor a polygon of n sides, but if we wish to use (180−)°-guards for any >0, then possibly 2n/3−1 guards are necessary.     

定数截尾下极值分布的参数估计

本文利用极值分布的一些特性和不动点原理,讨论了定数截尾情形下极值分布参数的估计问题,并提出了一种新的迭代算法;模拟结果显示,这种方法收敛速度快,且不受初始值选取的限制.     

论连通和单连通可裂G_2的A_q(λ)的酉性

设G为一连通,单连通的G2型可裂实李群,K为G的最大紧致子群,g为G的李代数的复化,Aq（λ）为 Knapp在[7]中的定义（g,K）-模.（MAN,σ,υ）表示由[7]中猜测方法确定的Aq（λ）的自然不可约分量的Langlands参数.本文确定了当λ位于弱好区域外时,哪些Langlands商J（MAN,σ,υ）为酉的.     

Universal fluctuations in the support of the random walk

A random walk starts from the origin of ad-dimensional lattice. The occupation numbern(x,t) equals unity if aftert steps site x has been visited by the walk, and zero otherwise. We study translationally invariant sumsM(t) of observables defined locally on the field of occupation numbers. Examples are the numberS(t) of visited sites, the areaE(t) of the (appropriately defined) surface of the set of visited sites, and, in dimension d=3, the Euler index of this surface. Ind≤ 3, theaverages - M(t) all increase linearly witht ast ® ∞. We show that in d=3, to leading order in an asymptotic expansion int, thedeviations from average ΔM(t) = M(t) -M(t) are, up to a normalization, allidentical to a single “universal” random variable. This result resembles an earlier one in dimensiond=2; we show that this universality breaks down ford>3.     

Computing power indices: Multilinear extensions and new characterizations

Johnston [Johnston, R.J., 1978. On the measurement of power: some reactions to Laver. Environment and Planning A 10, 907–914], Deegan and Packel [Deegan, J., Packel, E.W., 1979. A new index of power for simple n-person games. International Journal of Game Theory 7, 113–123], and Holler [Holler, M.J., 1982. Forming coalitions and measuring voting power. Political Studies 30, 262–271] proposed three power indices for simple games: Johnston index, Deegan–Packel index, and the Public Good Index. In this paper, methods to compute these indices by means of the multilinear extension of the game are presented. Furthermore, a new characterization of the Public Good Index is given. Our methods are applied to two real-world examples taken from the political field.     

Two-party competition with many constituences

The paper considers a single member district, simple plurality political system with n districts. There are two political parties, each consisting of n candidates. Individual candidates seek to win their district per se, but voters appreciate that final policy outcomes will depend upon: (1) which party wins control of the legislature, and (2) how party policy is derived from the party members' policies. Candidates take account of such voter deliberations in choosing their election strategies. A set of minimal sufficient conditions for an equilibrium to exist in this game is provided and the equilibrium characterized. While party policies are shown to converge in equilibrium, candidate policies in general do not - either across or within parties.     

The simple layer potential method of fundamental solutions for certain biharmonic problems

A novel formulation of the method of fundamental solutions for the numerical solution of plane biharmonic problems, based on the simple layer potential representation of Fichera, is presented. The applicability and accuracy of the method are demonstrated by examining its performance on a set of practical problems arising in Stokes fluid flow.