The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nowadays, microarray technology is available to generate a huge amount of information on gene expression. This information must be statistically processed and analyzed, in particular, to identify those genes which are useful for the diagnosis and prognosis of specific diseases. We discuss the possibility of applying game-theoretical tools, like the Shapley value, to the analysis of gene expression...
The rapid transit network design problem consists of the location of train alignments and stations, in a context where the demand makes its own decisions about the mode and route. The originality of this study is to incorporate in the model the line locations constraints with a bounded but variable number of lines, and lines with no predetermined origins and destinations. The computational experiments...
In this paper we introduce and study nonhomogeneous geometric random variables and their representations. We relate these to standard probability mass functions and to representations using birth-and-death processes. This facilitates comparison of various queueing models by birth/death models. We examine different queueing models with the same limiting distribution.
This paper provides an overview of the various shapes the best-reply multifunctions can take in 2×2×2 trimatrix games. It is shown that, unlike in 2×2 bimatrix games, the best replies to the opponents’ pure strategies do not completely determine the structure of the Nash equilibrium set.
Two kinds of vertical cooperative advertising program are considered in a distribution channel constituted by a manufacturer and a retailer, where the manufacturer pays part of the retailer’s advertising costs. In the first participation scheme, the manufacturer chooses his/her advertising participation rate in the retailer’s advertising effort and then each player determines the advertising effort...
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...
The quickest path problem is related to the classical shortest path problem, but its objective function concerns the transmission time of a given amount of data throughout a path, which involves both cost and capacity. The K-quickest simple paths problem generalises the latter, by looking for a given number K of simple paths in non-decreasing order of transmission time. Two categories of algorithms...
This rejoinder refers to the comments available at: http://dx.doi.org/10.1007/s11750-007-0026-z , http://dx.doi.org/10.1007/s11750-007-0027-y , http://dx.doi.org/10.1007/s11750-007-0028-x , http://dx.doi.org/10.1007/s11750-007-0029-9 , http://dx.doi.org/10.1007/s11750-007-0030-3 , http://dx.doi.org/10.1007/s11750-007-0031-2 .
We analyze the concept of large set for a coalitional game v introduced by Martínez-de-Albéniz and Rafels (Int. J. Game Theory 33(1):107–114, 2004). We give some examples and identify some of these sets. The existence of such sets for any game is proved, and several properties of largeness are provided. We focus on the minimality of such sets and prove its existence using Zorn’s lemma.
This paper presents an integrated approach to sensitivity analysis in some linear and non-linear programming problems. Closed formulas for the sensitivities of the objective function and primal and dual variables with respect to all parameters for some classes of problems are obtained. As particular cases, the sensitivities with respect to all data values, i.e., cost coefficients, constraints coefficients...
The purpose of this paper is to generalize the theory of “equal share analysis”, developed by Selten in 1972, to the one in which every player has a positive weight. We show that for any positive vector of weights, α∈R++N , it is always possible to find a coalition structure and a payoff vector forming a proportional regular configuration.
This paper surveys recent work by the author on the theoretical and algorithmic aspects of restless bandit indexation as well as on its application to a variety of problems involving the dynamic allocation of priority to multiple stochastic projects. The main aim is to present ideas and methods in an accessible form that can be of use to researchers addressing problems of such a kind. Besides building...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.