Sequencing games without initial order

In this note we study uncertainty sequencing situations, i.e., one-machine sequencing situations in which no initial order is specified. We associate cooperative games with these sequencing situations, study their core, and provide links with the classic sequencing games introduced by Curiel et al. (Eur J Oper Res 40:344–351, 1989). Moreover, we propose and characterize two simple cost allocation rules for uncertainty sequencing situations with equal processing times.     

Cooperative games of choosing partners and forming coalitions in the marketplace

Two games of interacting between a coalition of players in a marketplace and the residual players acting there are discussed, along with two approaches to fair imputation of gains of coalitions in cooperative games that are based on the concepts of the Shapley vector and core of a cooperative game. In the first game, which is an antagonistic one, the residual players try to minimize the coalition's gain, whereas in the second game, which is a noncooperative one, they try to maximize their own gain as a coalition. A meaningful interpretation of possible relations between gains and Nash equilibrium strategies in both games considered as those played between a coalition of firms and its surrounding in a particular marketplace in the framework of two classes of n-person games is presented. A particular class of games of choosing partners and forming coalitions in which models of firms operating in the marketplace are those with linear constraints and utility functions being sums of linear and bilinear functions of two corresponding vector arguments is analyzed, and a set of maximin problems on polyhedral sets of connected strategies which the problem of choosing a coalition for a particular firm is reducible to are formulated based on the firm models of the considered kind.     

k-边覆盖对策及其核心

本文针对从图的k-边覆盖问题引出的合作对策模型，利用线性规划对偶理论得到了其核心非空的一个充分条件和构造核心分配的多项式时间算法，并将这一结果推广到了一般的k-集合覆盖对策模型中．     

Kinetics of cooperative conformational transitions of lineal biopolymers

Cooperative conformational transitions of proteins and nucleic acids are of decisive importance to many processes of molecular biology, and particularly to their regulation. They proceed via numerous interdependent elementary processes, and their kinetics are therefore often complicated. They are frequently also very fast. However, kinetic analyses can be carried out by chemical relaxation methods. The theoretical interpretation is comparatively simple in the case of linear biopolymers. When the linear Ising model extended for kinetics was applied to model peptides and polynucleotides, it provided an insight into the fundamental principles of cooperative transformations.     

On the population monotonicity of independent set games

An independent set game is a cooperative game dealing with profit sharing in the maximum independent set problem. A population monotonic allocation scheme is a rule specifying how to share the profit of each coalition among its participants such that every participant is better off when the coalition expands. In this paper, we provide a necessary and sufficient characterization for independent set games admitting population monotonic allocation schemes. Moreover, our characterization can be verified efficiently.     

A new approach to agglomeration problems

In this paper, we study a location problem with positive externalities. We define a new transferable utility game, considering there is no restriction on the transfer of benefits between firms. We prove that the core of this game is non-empty, provide an expression for it, and an axiomatic characterization. We also study several core allocations, selected by means of a certain bankruptcy problem.     

无线多中继系统中判决门限辅助的快速Z转发协作

针对Z向转发(ZF)协作所有中继节点均参与协作转发导致的能耗利用不合理问题, 该文提出了一种适用于多中继场景下的门限辅助判决快速Z转发(DT-FZF)协作.当中继节点处接收信号对数似然比(LLR)的绝对值小于门限时,中继节点不参与协作转发;否则中继节点协作转发经截断后的对数似然比(LLR).放大转发(AF)、译码转发(DF)、分段转发(PF)和ZF协作可看作DT-FZF协作的特殊情况.在三中继系统,误比特率(BER)为10–3时,相比ZF协作,所提协作可获得约0.8 dB的性能增益.     

Cooperative Competition Clustering for Gene Selection

Clustering analysis of data from DNA microarray hybridization studies is an essential task for identifying biologically relevant groups of genes. Attribute cluster algorithm (ACA) has provided an attractive way to group and select meaningful genes. However, ACA needs much prior knowledge about the genes to set the number of clusters. In practical applications, if the number of clusters is misspecified, the performance of the ACA will deteriorate rapidly. We propose the Cooperative Competition Cluster Algorithm (CCCA) in this paper. In the algorithm, we assume that both cooperation and competition exist simultaneously between clusters in the process of clustering. By using this principle of Cooperative Competition, the number of clusters can be found in the process of clustering. Experimental results on a synthetic and gene expression data are demonstrated. The results show that CCCA can choose the number of clusters automatically and get excellent performance with respect to other competing methods.     

Cooperative schemes for path establishment in mobile ad-hoc networks under shadow-fading

The performance of routing protocols for multi-hop path-establishment in Mobile Ad-hoc NETworks (MANET) is examined when the individual radio links undergo shadow fading of parameterized severity. Such propagation modeling is typical of ground-level networking along with node mobility. The metrics of main interest are the probability of having a reliable multi-hop path plus the temporal statistics of such availability under a Markovian model. Such availability is an indicator for the suitability of the network to carry delay-sensitive applications (push-to-talk voice, streaming video) in uninterrupted manner. It is shown that high levels of diversity are necessary in such adverse environments, as obtained either by multiple independent paths or via concurrent cooperative transmission. Analytical and simulation comparisons of typical routing options are presented on the above metrics, plus on the required nodal engagement for supporting such diversity.