In a trade experiment, groups of students were taught how to bargain over pie generated in transportation game. Data collection and detailed group reports the bargaining process allowed us identify type followed its correspondence with cooperative game theory concepts. Explicit coalitions rather scarce (17%), although coalition stability was implied by 47.8% agreements. Efficiency achieved vast...

Given a partially-ordered finite alphabet Σ and a language L ⊆ Σ∗, how large can an antichain in L be (where L is ordered by the lexicographic ordering)? This fundamental property of partial orders is known as the width and its computation is the central extremal problem for partially ordered sets. More precisely, since L will in general be infinite, we should ask about the rate of growth of ma...

The induced width along an elimination ordering is an important factor in the space and time complexity of many inference algorithms for graphical models. Indeed, slight changes in induced width can sometimes dictate whether a particular problem is feasible (i.e. will t in memory) using variable elimination methods. For this reason, generating low width elimination orders has received extensive...

We explore the interaction between evolutionary stability and lexicographic preferences. To do so, we define a limit Nash equilibrium for a lexicographic game as the limit of Nash equilibria of nearby games with continuous preferences. Nash equilibria of lexicographic games are limit Nash equilibria, but not conversely. Modified evolutionarily stable strategies (Binmore and Samuelson, 1992. J. ...

In recent years, two-player zero-sum games with multidimensional objectives have received a lot of interest as a model for intricate systems that are required to satisfy several properties. In this framework, player 1 wins if he can ensure that all objectives are satisfied against any behavior of player 2. It is however often natural to provide more significance to one objective over another, a...

The topic of this paper are discrete decision problems with multiple criteria. We rst deene discrete multiple criteria decision problems and introduce a classiication scheme for multiple criteria optimization problems. To do so we use multiple criteria optimization classes. The main result is a characterization of the class of lexicographic max-ordering problems by two very useful properties, r...

A choice rule with affirmative action decides on the recipients of a limited number identical objects by reconciling two objectives: respecting priority ordering over applicants and supporting minority group. We extend standard formulation problem incorporating type function introduce monotonicity axioms how should respond to variations in these parameters. show that monotonic substitutable rul...

We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectively the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is canonical in a certain sense. We then go on to gene...

Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Gröbner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and describes why it should be very nearly the same speed the traditional algorithm, all other things being equal. However, experimental evidence suggests that s...

The Critical Path Method (CPM) is useful for planning and control of complex projects. The CPM identifies the critical activities in the critical path of an activity network. The successful implementation of CPM requires the availability of clear determined time duration for each activity. However, in practical situations this requirement is usually hard to fulfill since many of activities will...