Balanced contributions for TU games with awards and applications

Calleja et al. [Calleja, P., Borm, P., Hendrickx, R., 2005. Multi-issue allocation situations. European Journal of Operational Research 164, 730–747] introduced multi-issue allocation situations with awards. In this paper, we extend the classical model of cooperative games with transferable utility to the cooperative games with transferable utility and awards. We define a run-to-the-bank rule for cooperative games with transferable utility and awards and characterise it in terms of a property of balanced contributions. We apply our main result to bankruptcy problems and multi-issue allocation situations with awards.     

病态分析体系有偏估计的研究

运用广义岭估计和Ｌｉｕｋｅｊｉａｎ提出的有偏估计，对病态分析体系进行了数值模拟和实际光度测定，结果表明，广义岭估计显优于最小二乘估计，Ｌｉｕｋｅｊｉａｎ法有功效，可和为解析病态分析体系的化学计量学方法。     

大概念引领下的真实情境结构化教学实践*——羧酸及其衍生物

以高中化学“羧酸”一节为例,以大概念“化学源自生活,结构决定性质”为引领,结合系列真实情境,将乙酸的性质、羧酸的性质、羧酸衍生物的性质结构化地整合在一起,螺旋上升式地实施教学,顺应学生学习心理,促进学生学科知识结构化和认知结构化的建立,凸显教学中学生的主体地位,厚植学生的化学学科核心素养,也促进教师的二次成长,达到教学相长。     

A note on coalitional manipulation and centralized inventory management

In this note we deal with inventory games as defined in Meca et al. (Math. Methods Oper. Res. 57:483–491, 2003). In that context we introduce the property of immunity to coalitional manipulation, and demonstrate that the SOC-rule (Share the Ordering Cost) is the unique allocation rule for inventory games which satisfies this property. The authors acknowledge the financial support of Ministerio de Educación y Ciencia, FEDER and Xunta de Galicia through projects SEJ2005-07637-C02-02 and PGIDIT06PXIC207038PN.     

Chemical approach to ill-conditioned calculation problems in spectrophotometry

Multiple-component determinations present difficulties which cannot be resolved mathematically when there is severe spectral overlap, as in the determination of rare-earth elements with chromogenic reagents. The interdependence of absorptivities is greatly decreased when absorbance data from procedures based on several chromogenic reagents are used together in the calculations of calibration factors and concentrations. Various features of the method are discussed.     

Convex games with an infinite number of players and sequencing situations

In this paper we study convex games with an infinite countable set of agents and provide characterizations of this class of games. To do so, and in order to overcome some shortcomings related to the difficulty of dealing with infinite orderings, we need to use a continuity property. Infinite sequencing situations where the number of jobs is infinite countable can be related to convex cooperative TU games. It is shown that some allocations turn out to be extreme points of the core of an infinite sequencing game.     

A rational Arnoldi approach for ill-conditioned linear systems

For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a suitable function of matrix. In this sense, the method can be referred to as an iterative refinement process. Numerical experiments arising from integral equations and interpolation theory are presented. Finally, the method is extended to work in connection with the standard Tikhonov regularization with the right-hand side contaminated by noise.     

<Emphasis Type="Italic">p</Emphasis>-additive games: a class of totally balanced games arising from inventory situations with temporary discounts

We introduce a new class of totally balanced cooperative TU games, namely p-additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo Ph.D. thesis, Universidad Miguel Hernández de Elche, 2002) and contains the class of inventory cost games (Meca et al. Math. Methods Oper. Res. 57:481–493, 2003). It is shown that every p-additive game and its corresponding subgames have a nonempty core. We also focus on studying the character of concave or convex and monotone p-additive games. In addition, the modified SOC-rule is proposed as a solution for p-additive games. This solution is suitable for p-additive games, since it is a core-allocation which can be reached through a population monotonic allocation scheme. Moreover, two characterizations of the modified SOC-rule are provided. This work was partially supported by the Spanish Ministry of Education and Science and Generalitat Valenciana (grants MTM2005-09184-C02-02, ACOMP06/040, CSD2006-00032). Authors acknowledge valuable comments made by the Editor and the referee.     

具有模糊目标的多目标双矩阵对策集结与求解

针对不确定性多冲突环境,建立了多个具有模糊目标的多目标双矩阵对策的综合集结模型.在假定局中人各模糊目标的隶属函数为线性函数的情形下,基于总体模糊目标的可达度,给出了纳什均衡解的定义,并应用粒子群优化算法对集结模型求解.最后,给出一个军事例子说明了模型的实用有效性和粒子群优化算法求解的高效性.