Payoff expectancies between contingent serial moves of victim and aggressor in three hypothetical conflict situations

The expectancies of payoffs in the contingent serial interactive moves between victim and instigator, from the point of view of the victim, were measured for three hypothetical confrontations: someone pushes ahead of you in a movie line; a driver of a car takes a parking space you felt was yours; or you are the object of a rape attempt. These situations differ in urgency, and in the likelihood of success if there is resistance to the instigator. Expectations of persons were elicited as to their response to the particular aggressive act, the counter-response then expected of the instigator of the attack, and the subsequent contingent responses of each of the two persons, victim and instigator, until one or the other withdrew. The results show, in general, different payoffs at each interactive point over the ongoing serial stages in a situation, rather than an overall generalized contingency expectation, with these being different for self and the symbolized other, and also different for the three situations. Personality and sex-role measures showed minimal relation to the expectancies, and then not at the opening of the conflict, and for the instigator's rather than for the victim's expected responses.     

Some results concerning the quality of vertex solutions found by a method for multiple-objective linear programming

The Zionts-Wallenius algorithm for multiple-objective linear programming terminates with an extreme point solution that is locally but not necessary globally optimal. To find the globally optimal solution, a search along the facets of the solution space polyhedron may be required. In this paper we report the results of an experiment to determine how close the local and global optima are. We discuss the concept of closeness and propose one measure. Computer simulation is used to determine, in general, the quality of the solution found by the Zionts-Wallenius method for two types of non-linear utility functions. The merits of a search procedure are discussed in the context of the results.     

Several programming models with unascertained parameters and their applications

Several programming models are introduced with the consideration of available unascertained information. In this case, the so‐called unascertained information is some numerical values whose ranges are known but their exact values are not. These models resolve several vital weaknesses of the traditional programming methods to a certain degree. Our study includes considerations of linear and non‐linear programming models with grey parameters, grey 0–1 programming, and satisfactory and quasi‐optimal solutions of grey linear programmings. Finally, some practical applications are given in order to test the applicability of our theory. Copyright © 1999 John Wiley & Sons, Ltd.     

Optimal trade-offs of multiple factors in transfer pricing problems

Transfer pricing problems have been extensively researched by a number of scholars. It is well recognized that transfer pricing problems have a multiple-criteria (objectives) feature and can be formulated as a model of multiple-criteria linear programming. However, few methods have the capability of dealing with all possible optimal trade-offs of multiple criteria in optimal solutions of the models. In this paper a linear multiple-factor model is developed to provide managers with a more systematic and comprehensive scenario of all possible optimal transfer prices depending on both multiple criteria and multiple constraint levels. The trade-offs of all possible optimal transfer prices can be used as a basis for managers of a corporation to make a high-quality decision in selecting their transfer pricing systems for business competition. © 1998 John Wiley & Sons, Ltd.     

No Future

The difficulties with formalizing the intensional notions necessity, knowability and omniscience, and rational belief are well-known. If these notions are formalized as predicates applying to (codes of) sentences, then from apparently weak and uncontroversial logical principles governing these notions, outright contradictions can be derived. Tense logic is one of the best understood and most extensively developed branches of intensional logic. In tense logic, the temporal notions future and past are formalized as sentential operators rather than as predicates. The question therefore arises whether the notions that are investigated in tense logic can be consistently formalized as predicates. In this paper it is shown that the answer to this question is negative. The logical treatment of the notions of future and past as predicates gives rise to paradoxes due the specific interplay between both notions. For this reason, the tense paradoxes that will be presented are not identical to the paradoxes referred to above.     

Constraints for Input/Output Logics

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourrón/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step.     

Potential Infinite Models and Ontologically Neutral Logic

The paper begins with a more carefully stated version of ontologically neutral (ON) logic, originally introduced in (Hailperin, 1997). A non-infinitistic semantics which includes a definition of potential infinite validity follows. It is shown, without appeal to the actual infinite, that this notion provides a necessary and sufficient condition for provability in ON logic.     

A Calculus of Substitutions for DPL

We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. We give a calculus for the fragment and prove soundness and completeness.