On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Photorefractive Four-Wave Mixing Switches Utilizing Pockels Effect -Longitudinal and Lateral Switches-

We carried out detailed calculations for photorefractive wave-mixing switches based on one of three crystals with high electro-optic coefficients, namely, BaTiO₃, Strontium Barium Niobate (SBN (0.75)), and Potasium Sodium Strontium Barium Niobate (KNSBN). A comparison of results for the three crystals shows that a 0_-cut BaTiO³ crystal is suitable for a longitudinal switch and requires a voltage of about 80 for a 2-mm-thick crystal to induce sufficient phase mismatch. The electrodes must be transparent for the incident and diffracted beams. A 45_-cut SBN (0.75) crystal, however, is suitable for a lateral switch and requires a voltage of about 150 for a 1-mm-wide crystal. The electrodes do not need to be transparent.     

Invariant ideals of twisted crossed products

We will prove a result concerning the inclusion of non-trivial invariant ideals inside non-trivial ideals of a twisted crossed product. We will also give results concerning the primeness and simplicity of crossed products of twisted actions of locally compact groups on -algebras. Received: 25 January 2002; in final form: 22 May 2002/Published online: 2 December 2002 This work is partially supported by Hong Kong RGC Direct Grant.     

Multi-Item Scheduling by Benders' Decomposition

Scheduling the production of several items requires the determination of production quantities in different periods in the presence of resource constraints. Several approximate and heuristic algorithms have been proposed to solve this problem. However, no method for finding an optimal solution has as yet been developed. It is shown that the problem may be solved advantageously using Benders' decomposition. The subproblem in Benders' decomposition is shown to be a transportation problem, and some strategies for solving the master problem are indicated. The paper concludes with a sample problem demonstrating the application of the method.     

An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.     

Groups in which every non-abelian subgroup is permutable

A subgroupH of a groupG is said to bepermutable ifHX=XH for every subgroupX ofG. In this paper the structure of groups in which every subgroup either is abelian or permutable is investigated. This work was done while the last author was visiting the University of Napoli Federico II. He thanks the “Dipartimento di Matematica e Applicazioni” for its financial support.