This paper is concerned with the question of defining the bargaining set, a cooperative game solution, when cooperation takes place in a dynamic setting. The focus is on dynamic cooperative games in which the players face (finite or infinite) sequences of exogenously specified TU-games and receive sequences of imputations against those static cooperative games in each time period. Two alternati...

This paper is about an applicative solution to the IMPERATIVE Set Union Problem, as posed by Peyton-Jones [3]. The adjectivisation is used here to emphasise that the problem was thought to pose significant questions in finding an applicative solution of the same order of complexity as the imperative version. We show one such solution, written in the style of KRC [5]. The same reasoning, when ap...

To address the need for published data, considerable effort has gone into formalizing the process of data publication. From funding agencies to publishers, data publication has rapidly become a requirement. Digital Object Identifiers (DOI) and data citations have enhanced the integration and availability of data. The challenge facing data publishers now is to deal with the increased number of p...

Borjas, Problem 4­4 This question asks how the wages of (presumably high‐skilled) natives should change when there is a change in the quantity of available low‐skilled (immigrant) labor assuming that natives and immigrants are complements. Whenever two factors of production are complementary, an increase in one increases the returns to another. So in this case, the llegal alien hiring penaltie...

A new method for solving the hitting set problem is proposed. This method is based on the mapping of the problem onto an integer programming optimization problem. This new approach provides an algorithm with much better performance compare to the algorithms for the bitting set problem that currently are used for solving the diagnosis problem. The relation of this approach with the satisfiabilit...

We consider systems of linear equations, where the elements of the matrix and of the right-hand side vector are linear functions of interval parameters. We study parametric AE solution sets, which are defined by universally and existentially quantified parameters, and the former precede the latter. Based on a recently obtained explicit description of such solution sets, we present three approac...

Given a finite set E and a family F={E1,. . . ,Em} of subsets of E such that F covers E, the famous unicost set covering problem (USCP) is to determine the smallest possible subset of F that also covers E. We study in this paper a variant, called the Large Set Covering Problem (LSCP), which differs from the USCP in that E and the subsets Ei are not given in extension because they are very large...

Confidentiality was and will always remain a critical need in the exchanges either between persons or the official parties. Recently, cryptology has made a jump, from classical form to the quantum one, we talk about quantum cryptography. This theory, although is perfectly safe, there are still binding limits of implementation. In this paper, we developed a new cryptographic protocol, called BCB...

We define a notion of dynamic (vNM) stable set for a tournament relation. Dynamic stable set satisfies (i) an external direct stability property, and (ii) an internal indirect stability property. Importantly, stability criteria are conditioned on the histories of past play, i.e. the dominance system has memory. Due to the asymmetry of the defining stability criteria, a dynamic stable set is sta...

We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer–Skeel and the Hansen–Bliek–Rohn bounds for this case, comparing and refinement of both. We show that the latter bounds are not provable better, and that they are also sometimes too pessimistic. The presented form of both methods is suitable for combining them into one to get a more e...