the consistent value of fuzzy games in the framework of fuzzy games we offer an extension of the reduced game introduced by hart and mas colell which we name the self reduced game according to consistency which related to the self reduced game we provide a definition of the consistent value which is a generalization of the shapley value of fuzzy games we adopt three existing concepts from coalitional game theory and reinterpret them in the framework of fuzzy games the first one is that there exists a unique potential function and the resulting payoff vector coincides with the consistent value second based on the properties of balanced contributions and consistency we offer several axiomatizations of the consistent value finally we propose a dynamic process to illustrate that the consistent value can be reached by players who start from an arbitrary efficient payoff vector and make successive adjustments

fuzzy formulation of auctions and optimal sequencing for multiple auctions abstract current research on auctions is mainly based on the game theory in the first part of this paper we propose a fuzzy set based formulation of auctions we define fuzzy sets to represent the seller and buyers valuations bid possibilities and win possibilities analyzing the properties of these fuzzy sets we study fuzzy versions of discriminating and nondiscriminating bidding strategies for each bidder in a single object auction by using bellman and zadeh s concept of confluence of fuzzy decisions instead of the game theoretic nash equilibrium the monotonically decreasing membership function replaces of the corresponding distribution density function in milgrom and weber s auction theory in the second part of the paper we develop a soft computing approach to maximize the seller s revenue in multiple object auctions through the use of object sequencing the proposed sequencing approach is based on fuzzy rule quantification numerical experience shows the potential of the proposed approach for application in practical auctions

ideal spatial adaptation by wavelet shrinkage summary with ideal spatial adaptation an oracle furnishes information about how best to adapt a spatially variable estimator whether piecewise constant piecewise polynomial variable knot spline or variable bandwidth kernel to the unknown function estimation with the aid of an oracle offers dramatic advantages over traditional linear estimation by nonadaptive kernels however it is a priori unclear whether such performance can be obtained by a procedure relying on the data alone we describe a new principle for spatially adaptive estimation selective wavelet reconstruction we show that variable knot spline fits and piecewise polynomial fits when equipped with an oracle to select the knots are not dramatically more powerful than selective wavelet reconstruction with an oracle we develop a practical spatially adaptive method riskshrink which works by shrinkage of empirical wavelet coefficients riskshrink mimics the performance of an oracle for selective wavelet reconstruction as well as it is possible to do so a new inequality in multivariate normal decision theory which we call the oracle inequality shows that attained performance differs from ideal performance by at most a factor of approximately 2 log n where n is the sample size moreover no estimator can give a better guarantee than this within the class of spatially adaptive procedures riskshrink is essentially optimal relying only on the data it comes within a factor log 2 n of the performance of piecewise polynomial and variableknot spline methods equipped with an oracle in contrast it is unknown how or if piecewise polynomial methods could be made to function this well when denied access to an oracle and forced to rely on data alone

fuzzy interval cooperative games we introduce a core like concept called f core for games in which the worth of any coalition is given by means of a fuzzy interval such a class of cooperative games was introduced by mares in 1999 different from mares approach the f core generalizes the interval core introduced by alparslan branzei and tijs in 2008 for games where the worth of any coalition is a compact interval of the real line moreover we introduce a balanced like condition and prove that this condition is necessary but not sufficient to guarantee the f core to be non empty

adaptive noise smoothing filter for images with signal dependent noise in this paper we consider the restoration of images with signal dependent noise the filter is noise smoothing and adapts to local changes in image statistics based on a nonstationary mean nonstationary variance nmnv image model for images degraded by a class of uncorrelated signal dependent noise without blur the adaptive noise smoothing filter becomes a point processor and is similar to lee s local statistics algorithm 16 the filter is able to adapt itself to the nonstationary local image statistics in the presence of different types of signal dependent noise for multiplicative noise the adaptive noise smoothing filter is a systematic derivation of lee s algorithm with some extensions that allow different estimators for the local image variance the advantage of the derivation is its easy extension to deal with various types of signal dependent noise film grain and poisson signal dependent restoration problems are also considered as examples all the nonstationary image statistical parameters needed for the filter can be estimated from the noisy image and no a priori information about the original image is required

multiscale modeling and estimation of poisson processes with application to photon limited imaging many important problems in engineering and science are well modeled by poisson processes in many applications it is of great interest to accurately estimate the intensities underlying observed poisson data in particular this work is motivated by photon limited imaging problems this paper studies a new bayesian approach to poisson intensity estimation based on the haar wavelet transform it is shown that the haar transform provides a very natural and powerful framework for this problem using this framework a novel multiscale bayesian prior to model intensity functions is devised the new prior leads to a simple bayesian intensity estimation procedure furthermore we characterize the correlation behavior of the new prior and show that it has 1 f spectral characteristics the new framework is applied to photon limited image estimation and its potential to improve nuclear medicine imaging is examined

games with fuzzy permission structure a conjunctive approach abstract a cooperative game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate regardless of the actions that the other players take a permission structure over the set of players describes a hierarchical organization where there are players who need permission from certain other players before they are allowed to cooperate with others various assumptions can be made about how a permission structure affects the cooperation possibilities in the conjunctive approach it is assumed that each player needs permission from all his superiors this paper deals with fuzzy permission structures in the conjunctive approach in this model players could depend partially on other players that is they may have certain degree of autonomy first we define a value for games with fuzzy permission structure that only takes into account the direct relations among players and provide a characterization for this value finally we study a value for games with fuzzy permission structure which takes account of the indirect relations among players

max min solutions for fuzzy multiobjective matrix games abstract in this paper we consider two person zero sum games with fuzzy multiple payoff matrices we assume that each player has a fuzzy goal for each of the payoffs a degree of attainment of the fuzzy goal is defined and the max min strategy with respect to the degree of attainment of the fuzzy goal is examined if all of the membership functions both for the fuzzy payoffs and for the fuzzy goals are linear the formulated mathematical programming problem which yields the max min strategy can be reduced to the linear programming problem by making use of sakawa s method the variable transformations and the relaxation procedure

a simple method to determine the critical buckling loads for axially inhomogeneous beams with elastic restraint in this paper a new and simple approach is presented to exactly calculate the critical buckling loads of beams with arbitrarily axial inhomogeneity for various end boundary conditions we transform the governing equation with varying coefficients to linear algebraic equations then a characteristic equation in critical buckling loads will be obtained several examples of estimating buckling loads under typical end supports are discussed by comparing our numerical results with the exact and existing results for homogeneous and nonhomogeneous beams it can be found that our method has fast convergence and the obtained numerical results have high accuracy moreover the buckling behavior of a functionally graded beam composed of aluminum and zirconia as two constituent phases is investigated for axially varying material properties the effects of gradient parameters on the critical buckling loads are elucidated finally we give an example to illustrate the enhancement of the load carrying capacity of tapered beams for admissible shape profiles with constant volume or weight the proposed method is of benefit to optimum design of beams against buckling in engineering applications

a concept of egalitarianism under participation constraints we define a new solution concept for transferable utility cooperative games in characteristic function form in a framework where individuals believe in equality as a desirable social goal although private preferences dictate selfish behavior this latter aspect implies that the solution outcome s must satisfy core like participation constraints while the concern for equality entails choice of lorenz maximal elements from within the set of payoffs satisfying the participation constraints

convex and exact games with non transferable utility we generalize exactness to games with non transferable utility ntu in an exact game for each coalition there is a core allocation on the boundary of its payofi set convex games with transferable utility are well known to be exact we study flve generalizations of convexity in the ntu setting we show that each of ordinal coalition merge individual merge and marginal convexity can be unifled under ntu exactness we provide an example of a cardinally convex game which is not ntu exact finally we relate the classes of balanced totally balanced ntu exact totally ntu exact ordinally convex cardinally convex coalition merge convex individual merge convex and marginal convex

wavelet based image estimation an empirical bayes approach using jeffrey s noninformative prior the sparseness and decorrelation properties of the discrete wavelet transform have been exploited to develop powerful denoising methods however most of these methods have free parameters which have to be adjusted or estimated in this paper we propose a wavelet based denoising technique without any free parameters it is in this sense a universal method our approach uses empirical bayes estimation based on a jeffreys noninformative prior it is a step toward objective bayesian wavelet based denoising the result is a remarkably simple fixed nonlinear shrinkage thresholding rule which performs better than other more computationally demanding methods

the cg position value for games on fuzzy communication structures abstract a cooperative game for a set of agents establishes a fair allocation of the profit obtained for their cooperation the best known of these allocations is the shapley value a communication structure defines the feasible bilateral communication relationships among the agents in a cooperative situation some solutions incorporating this information have been defined from the shapley value the myerson value the position value etc later fuzzy communication structures were introduced in a fuzzy communication structure the membership of the players and the relations among them are leveled several ways of defining the myerson value for games on fuzzy communication structure were proposed one of them is the choquet by graphs cg version now we study in this work the cg position value and its calculation the cg position value is defined as a solution for games with fuzzy communication structure which considers the bilateral communications as players so the shapley value is applied for a new game the link game over the fuzzy sets of links in the fuzzy communication structure and the profit obtained for each link is allocated between both players in the link as we see in our examples and results the cg position value is more concerned with the graphical position of the players and their communications than the other cg values in this paper we also introduce a procedure to compute exactly the position value avoiding to calculate the characteristic function of the link game for all coalitions this procedure is used to determine the cg position value finally we compare the new value with other cg values in an applied example about the power of the groups in the european parliament

an enhanced exponential matrix approach aimed at the stability of piecewise beams on elastic foundation in this paper an enhanced exponential collocation method for the stability assessment of piecewise beams resting on elastic foundation and subjected to both non uniform distributed and concentrated loads is presented the exponential basis functions usually adopted in literature are enriched with trigonometric functions that make the eigenvalue analysis well posed without reducing the original simplicity of the method a measure of the error occurring from the proposed approach and its improvement are also proposed several examples aimed at estimating the buckling loads under typical end supports are discussed a comparison with exact and with other numerical results that are available in literature are carried out such a comparison shows the high accuracy and the fast convergence of the proposed approach

random payoff two person zero sum game with joint chance constraints abstract we study a two person zero sum game where the payoff matrix entries are random and the constraints are satisfied jointly with a given probability we prove that for the general random payoff zero sum game there exists a weak duality between the two formulations i e the optimal value of the minimizing player is an upper bound of the one of the maximizing player under certain assumptions we show that there also exists a strong duality where their optimal values are equal moreover we develop two approximation methods to solve the game problem when the payoff matrix entries are independent and normally distributed finally numerical examples are given to illustrate the performances of the proposed approaches

on nonsmooth and discontinuous problems of stochastic systems optimization a class of stochastic optimization problems is analyzed that cannot be solved by deterministic and standard stochastic approximation methods we consider risk control problems optimization of stochastic networks and discrete event systems screening irreversible changes and pollution control the results of ermoliev et al are extended to the case of stochastic systems and general constraints it is shown that the concept of stochastic mollifier gradient leads to easily implementable computational procedures for systems with lipschitz and discontinuous objective functions new optimality conditions are formulated for designing stochastic search procedures for constrained optimization of discontinuous systems

image denoising in mixed poisson gaussian noise we propose a general methodology pure let to design and optimize a wide class of transform domain thresholding algorithms for denoising images corrupted by mixed poisson gaussian noise we express the denoising process as a linear expansion of thresholds let that we optimize by relying on a purely data adaptive unbiased estimate of the mean squared error mse derived in a non bayesian framework pure poisson gaussian unbiased risk estimate we provide a practical approximation of this theoretical mse estimate for the tractable optimization of arbitrary transform domain thresholding we then propose a pointwise estimator for undecimated filterbank transforms which consists of subband adaptive thresholding functions with signal dependent thresholds that are globally optimized in the image domain we finally demonstrate the potential of the proposed approach through extensive comparisons with state of the art techniques that are specifically tailored to the estimation of poisson intensities we also present denoising results obtained on real images of low count fluorescence microscopy

shapley mappings and the cumulative value for n person games with fuzzy coalitions abstract in this paper we prove existence and uniqueness of the so called shapley mapping which is a solution concept for a class of n person games with fuzzy coalitions whose elements are defined by the specific structure of their characteristic functions the shapley mapping when it exists associates to each fuzzy coalition in the game an allocation of the coalitional worth satisfying the efficiency the symmetry and the null player conditions it determines a cumulative value that is the sum of all coalitional allocations for whose computation we provide an explicit formula

optimal coalition formation and surplus distribution two sides of one coin abstract a fuzzy coalitional game represents a situation in which players can vary the intensity at which they participate in the coalitions accessible to them as opposed to the treatment as a binary choice in the non fuzzy crisp game building on the property not made use of so far in the literature of fuzzy games that a fuzzy game can be represented as a convex program this paper shows that the optimum of such a program determines the optimal coalitions as well as the optimal rewards for the players two sides of one coin furthermore this program is seen to provide a unifying framework for representing the core the least core and the fuzzy nucleolus among others next we derive conditions for uniqueness of core rewards and to deal with non uniqueness we introduce a family of parametric perturbations of the convex program that encompasses a large number of well known concepts for selection from the core including the dutta ray solution dutta and ray 1989 the equal sacrifice solution yu 1973 the equal division solution selten 1972 and the tau value tijs 1981 we also generalize the concept of the grand coalition of contracting players by allowing for multiple technologies and we specify the conditions for this allocation to be unique and egalitarian finally we show that our formulation offers a natural extension to existing models of production economies with threats and division rules for common surplus

a lexicographical solution concept in an n person cooperative fuzzy game abstract in this paper a new solution concept in an n person cooperative fuzzy game with sidepayment is proposed we first define an excess with respect to a player in a fuzzy game with sidepayment usually the concept of an excess is defined for each coalition in contrast however we define an excess of a player by summing up all the excess of a coalition to which he belongs by considering a payoff vector which minimizes the excess of a player in the lexicographical order we proposed a new solution concept in a fuzzy game as well as in a nonfuzzy game then we further consider the problem to extend a nonfuzzy game into a fuzzy game such an extension can be described by the mappings from a characteristic function in a nonfuzzy game into a characteristic function in a fuzzy game an illustrative numerical example of the proposed solution concept to some extended fuzzy games is also presented

capital allocation a la aumann shapley for non differentiable risk measures abstract we study capital allocation rules satisfying suitable properties for convex and quasi convex risk measures by focusing in particular on a family of capital allocation rules based on the dual representation for risk measures and inspired by the aumann shapley allocation principle these rules extend some well known methods of capital allocation for coherent and convex risk measures to the case of non gateaux differentiable risk measures we also analyze the properties of the allocation principles here introduced and discuss their suitability in the quasi convex context

myerson values for games with fuzzy communication structure in 1977 myerson considered cooperative games with communication structure a communication structure is an undirected graph describing the bilateral relationships among the players he introduced the concept of allocation rule for a game as a function obtaining an outcome for each communication structure among the players of the game the myerson value is a specific allocation rule extending the shapley value of the game more recently the authors studied games with fuzzy communication structures using fuzzy graph theoretic ideas now we propose a general framework in order to define fuzzy myerson values players in a coalition need to measure their profit using their real individual and communication capacities at every moment because these attributes are fuzzy when the game is proposed so they look for forming connected coalitions working at the same level the different ways to obtain these partitions by levels determine different myerson values for the game several interesting examples of these ways are studied in the paper following known models in games with fuzzy coalitions the proportional model and the choquet model

average monotonic cooperative fuzzy games in this paper we study average monotonic fuzzy games a subclass of monotonic cooperative fuzzy games and prove that for a continuous average monotonic cooperative fuzzy game which has a crisp maximal coalition of maximum excess at every imputation its aubin core coincides with its fuzzy bargaining set

entropy based algorithms for best basis selection adapted waveform analysis uses a library of orthonormal bases and an efficiency functional to match a basis to a given signal or family of signals it permits efficient compression of a variety of signals such as sound and images the predefined libraries of modulated waveforms include orthogonal wavelet packets and localized trigonometric functions and have reasonably well controlled time frequency localization properties the idea is to build out of the library functions an orthonormal basis relative to which the given signal or collection of signals has the lowest information cost the method relies heavily on the remarkable orthogonality properties of the new libraries all expansions in a given library conserve energy and are thus comparable several cost functionals are useful one of the most attractive is shannon entropy which has a geometric interpretation in this context

fuzzy extensions of bargaining sets and their existence in cooperative fuzzy games recently the concept of classical bargaining set given by aumann and maschler in 1964 has been extended to fuzzy bargaining set in this paper we give a modification to correct some weakness of this extension we also extend the concept of the mas colell s bargaining set the other major type of bargaining sets to its corresponding fuzzy bargaining set our main effort is to prove existence theorems for these two types of fuzzy bargaining sets we will also give necessary and sufficient conditions for these bargaining sets to coincide with the aubin core in a continuous superadditive cooperative fuzzy game which has a crisp maximal coalition of maximum excess at each payoff vector we show that both aumann maschler and mas colell fuzzy bargaining sets of a continuous convex cooperative fuzzy game coincide with its aubin core

games with fuzzy authorization structure a cooperative game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate regardless of the actions that the other players take it is often assumed that the players are free to participate in any coalition but in some situations there are dependency relationships among the players that restrict their capacity to cooperate within some coalitions those relationships must be taken into account if we want to distribute the profits fairly in this respect several models have been proposed in literature in all of them dependency relationships are considered to be complete in the sense that either a player is allowed to fully cooperate within a coalition or they cannot cooperate at all nevertheless in some situations it is possible to consider another option that a player has a degree of freedom to cooperate within a coalition a model for those situations is presented

wavelet domain filtering for photon imaging systems many imaging systems rely on photon detection as the basis of image formation one of the major sources of error in these systems is poisson noise due to the quantum nature of the photon detection process unlike additive gaussian white noise the variance of poisson noise is proportional to the underlying signal intensity and consequently separating signal from noise is a very difficult task in this paper we perform a novel gedankenexperiment to devise a new wavelet domain filtering procedure for noise removal in photon imaging systems the filter adapts to both the signal and the noise and balances the trade off between noise removal and excessive smoothing of image details designed using the statistical method of cross validation the filter is simultaneously optimal in a small sample predictive sum of squares sense and asymptotically optimal in the mean square error sense the filtering procedure has a simple interpretation as a joint edge detection estimation process moreover we derive an efficient algorithm for performing the filtering that has the same order of complexity as the fast wavelet transform itself the performance of the new filter is assessed with simulated data experiments and tested with actual nuclear medicine imagery

image coding using wavelet transform a scheme for image compression that takes into account psychovisual features both in the space and frequency domains is proposed this method involves two steps first a wavelet transform used in order to obtain a set of biorthogonal subclasses of images the original image is decomposed at different scales using a pyramidal algorithm architecture the decomposition is along the vertical and horizontal directions and maintains constant the number of pixels required to describe the image second according to shannon s rate distortion theory the wavelet coefficients are vector quantized using a multiresolution codebook to encode the wavelet coefficients a noise shaping bit allocation procedure which assumes that details at high resolution are less visible to the human eye is proposed in order to allow the receiver to recognize a picture as quickly as possible at minimum cost a progressive transmission scheme is presented it is shown that the wavelet transform is particularly well adapted to progressive transmission

convex fuzzy games and participation monotonic allocation schemes in this paper the cone of convex cooperative fuzzy games is studied as in the classical case of convex crisp games these games have a large core and the fuzzy shapley value is the barycenter of the core surprisingly the core and the weber set coincide as in the classical case but the coincidence of these sets for a fuzzy game does not imply automatically convexity as in the crisp case participation monotonic allocation schemes pamas are introduced and it turns out that each core element of a convex fuzzy game is pamas extendable

linear production games with fuzzy control the aim of this paper is to analyse linear production with committee control situations arising when controllers face the possibility of graduating their options in order to model these situations we consider several kinds of fuzzy controls which can be modelled as different simple fuzzy games an lp game which is an extension of lp games with committee control introduced in curiel et al on balanced games and games with committee control or spectrum 11 1989 83 88 is obtained and its core is studied

nonlinear wavelet image processing variational problems compression and noise removal through wavelet shrinkage this paper examines the relationship between wavelet based image processing algorithms and variational problems algorithms are derived as exact or approximate minimizers of variational problems in particular we show that wavelet shrinkage can be considered the exact minimizer of the following problem given an image f defined on a square i minimize over all g in the besov space b11 l1 i the functional f g l2 i 2 g b11 l1 i we use the theory of nonlinear wavelet image compression in l2 i to derive accurate error bounds for noise removal through wavelet shrinkage applied to images corrupted with i i d mean zero gaussian noise a new signal to noise ratio snr which we claim more accurately reflects the visual perception of noise in images arises in this derivation we present extensive computations that support the hypothesis that near optimal shrinkage parameters can be derived if one knows or can estimate only two parameters about an image f the largest for which f bq lq i 1 q 2 1 2 and the norm f bq lq i both theoretical and experimental results indicate that our choice of shrinkage parameters yields uniformly better results than donoho and johnstone s visushrink procedure an example suggests however that donoho and johnstone s 1994 1995 1996 sureshrink method which uses a different shrinkage parameter for each dyadic level achieves a lower error than our procedure

a new shapley value for games with fuzzy coalitions abstract this paper deals with cooperative games over fuzzy coalitions in these situations there is a continuous set of fuzzy coalitions instead of a finite set of them as in the classical case the unit square in an n dimensional space there exist in the literature two different extensions of the known shapley value for crisp games to games with fuzzy coalitions the crisp shapley value and the diagonal value the first value only uses a finite information in the set of fuzzy coalitions the vertices of the square while the second one uses a neighbourhood of the diagonal of the square we propose a new extension of the shapley value improving the crisp shapley value for games with fuzzy coalitions this new version uses the faces of the square namely an infinity quantity of information we analyze several properties of the new value we endow it with an axiomatization and we study the behavior when it is applied to known fuzziness of crisp games

wavelet based rician noise removal for magnetic resonance imaging it is well known that magnetic resonance magnitude image data obey a rician distribution unlike additive gaussian noise rician noise is signal dependent and separating signal from noise is a difficult task rician noise is especially problematic in low signal to noise ratio snr regimes where it not only causes random fluctuations but also introduces a signal dependent bias to the data that reduces image contrast this paper studies wavelet domain filtering methods for rician noise removal we present a novel wavelet domain filter that adapts to variations in both the signal and the noise

platelets a multiscale approach for recovering edges and surfaces in photon limited medical imaging the nonparametric multiscale platelet algorithms presented in this paper unlike traditional wavelet based methods are both well suited to photon limited medical imaging applications involving poisson data and capable of better approximating edge contours this paper introduces platelets localized functions at various scales locations and orientations that produce piecewise linear image approximations and a new multiscale image decomposition based on these functions platelets are well suited for approximating images consisting of smooth regions separated by smooth boundaries for smoothness measured in certain holder classes it is shown that the error of m term platelet approximations can decay significantly faster than that of m term approximations in terms of sinusoids wavelets or wedgelets this suggests that platelets may outperform existing techniques for image denoising and reconstruction fast platelet based maximum penalized likelihood methods for photon limited image denoising deblurring and tomographic reconstruction problems are developed because platelet decompositions of poisson distributed images are tractable and computationally efficient existing image reconstruction methods based on expectation maximization type algorithms can be easily enhanced with platelet techniques experimental results suggest that platelet based methods can outperform standard reconstruction methods currently in use in confocal microscopy image restoration and emission tomography

a generalization of the aumann shapley value for risk capital allocation problems abstract the paper proposes a new method to allocate risk capital to divisions or lines of business within a firm existing literature advocates an allocation rule that in game theoretic terms is equivalent to using the aumann shapley value as allocation mechanism the aumann shapley value however is only well defined if a specific differentiability condition is satisfied the rule that we propose is characterized as the limit of an average of path based allocation rules with grid size converging to zero the corresponding allocation rule is equal to the aumann shapley value if it exists if the aumann shapley value does not exist the allocation rule is equal to the weighted average of the aumann shapley values of nearby capital allocation problems

buckling and post buckling analysis of extensible beam columns by using the differential quadrature method buckling and post buckling analysis of extensible beam columns is performed numerically in this paper it was experienced earlier that in some cases the numerical integration would not produce the convergent post buckling solutions especially under high loads therefore a new differential quadrature dq based iterative numerical integration method is proposed to solve post buckling differential equations of extensible beam columns six cases including five classical euler buckling cases are analyzed critical loads and convergent post buckling solutions under different applied loads are obtained the results are compared with the existing multiple scales solutions it is found that under high applied loads the small rotation assumption in obtaining multiple scales solutions is no longer valid the proposed iterative dq based numerical integration method can yield reliable and accurate post buckling solutions even at high applied loads for the cases investigated

cooperation among agents with a proximity relation abstract a cooperative game consists of a set of players and a characteristic function determining the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate regardless of the actions that the other players take the relationships of closeness among the players should modify the bargaining among them and therefore their payoffs the first models that have studied this closeness used a priori unions or undirected graphs in the a priori union model a partition of the big coalition is supposed each element of the partition represents a group of players with the same interests the groups negotiate among them to form the grand coalition and later inside each one players bargain among them now we propose to use proximity relations to represent leveled closeness of the interests among the players and extending the a priori unions model

multiscale poisson data smoothing summary the paper introduces a framework for non linear multiscale decompositions of poisson data that have piecewise smooth intensity curves the key concept is conditioning on the sum of the observations that are involved in the computation of a given multiscale coefficient within this framework most classical wavelet thresholding schemes for data with additive homoscedastic noise can be used any family of wavelet transforms orthogonal biorthogonal or second generation can be incorporated in this framework our second contribution is to propose a bayesian shrinkage approach with an original prior for coefficients of this decomposition as such the method combines the advantages of the haar fisz transform with wavelet smoothing and bayesian multiscale likelihood models with additional benefits such as extendability towards arbitrary wavelet families simulations show an important reduction in average squared error of the output compared with the present techniques of anscombe or fisz variance stabilization or multiscale likelihood modelling

characterization of the equilibrium strategy of the bimatrix game with fuzzy payoff in this paper we consider fuzzy bimatrix games which mean bimatrix games with fuzzy payoff matrices we define two types of concepts of equilibrium strategy and investigate their relationships moreover we prove that these nash equilibrium strategies exist in any fuzzy bimatrix games

elastic stability of euler columns with a continuous elastic restraint using variational iteration method in this paper analysis of elastic stability for continuously restrained euler columns is conducted by means of variational iteration method vim a uniform homogeneous column is assumed to be restrained along its length the restraint considered in this study is an elastic foundation model in engineering practice and it is of great interest to foundation engineers hence the variation of the critical buckling loads with the stiffness of elastic restraint is investigated using vim for the restrained columns with different end conditions obtaining analytical solutions for these types of problems is not a simple procedure since the equations of stability criteria are highly nonlinear this study presents the application of vim for obtaining exact solutions for continuously restrained euler columns the study proves that vim is a very efficient and promising approach in the elastic stability analysis of specified problems

a note on the core minimal conversely consistent enlargement abstract the moulin reduction is extended by reducing the number of the players to the framework of fuzzy games based on this extended moulin reduction the axiomatic result of the core in tadenuma s 25 case does not hold in the context of fuzzy games and the core also violates the converse consistency therefore we propose the minimal core which possesses the converse consistency and is also the smallest solution satisfying the core

automatic decrease of the penalty parameter in exact penalty function methods this paper presents an analysis of the involvement of the penalty parameter in exact penalty function methods that yields modifications to the standard outer loop which decreases the penalty parameter typically dividing it by a constant the procedure presented is based on the simple idea of making explicit the dependence of the penalty function upon the penalty parameter and is illustrated on a linear programming problem with the l1 exact penalty function and an active set approach the procedure decreases the penalty parameter when needed to the maximal value allowing the inner minimization algorithm to leave the current iterate it moreover avoids unnecessary calculations in the iteration following the step in which the penalty parameter is decreased we report on preliminary computational results which show that this method can require fewer iterations than the standard way to update the penalty parameter this approach permits a better understanding of the performance of exact penalty methods

measuring the interactions among variables of functions over the unit hypercube abstract by considering a least squares approximation of a given square integrable function f 0 1 n r by a multilinear polynomial of a specified degree we define an index which measures the overall interaction among variables of f this definition extends the concept of banzhaf interaction index introduced in cooperative game theory our approach is partly inspired from multilinear regression analysis where interactions among the independent variables are taken into consideration we show that this interaction index has appealing properties which naturally generalize several properties of the banzhaf interaction index in particular we interpret this index as an expected value of the difference quotients of f or under certain natural conditions on f as an expected value of the derivatives of f finally we discuss a few applications of the interaction index in aggregation function theory

on characterization of equilibrium strategy of two person zero sum games with fuzzy payoffs in this paper we consider fuzzy matrix games namely two person zero sum games with fuzzy payoffs based on fuzzy max order for such games we define three kinds of concepts of minimax equilibrium strategies and investigate their properties first we shall show that these equilibrium strategies are characterized as nash equilibrium strategies of a family of parametric bi matrix games with crisp payoffs second we investigate properties of values of fuzzy matrix games by means of possibility and necessity measures in addition we give a numerical example to illustrate utility of our approaches

concave measures and the fuzzy core of exchange economies with heterogeneous divisible commodities the main purpose of this paper is to prove the existence of the fuzzy core of an exchange economy with a heterogeneous divisible commodity in which preferences of individuals are given by nonadditive utility functions defined on a s algebra of admissible pieces of the total endowment of the commodity the problem is formulated as the partitioning of a measurable space among finitely many individuals applying the yosida hewitt decomposition theorem we also demonstrate that partitions in the fuzzy core are supportable by prices in l 1

a statistical multiscale framework for poisson inverse problems this paper describes a statistical multiscale modeling and analysis framework for linear inverse problems involving poisson data the framework itself is founded upon a multiscale analysis associated with recursive partitioning of the underlying intensity a corresponding multiscale factorization of the likelihood induced by this analysis and a choice of prior probability distribution made to match this factorization by modeling the splits in the underlying partition the class of priors used here has the interesting feature that the noninformative member yields the traditional maximum likelihood solution other choices are made to reflect prior belief as to the smoothness of the unknown intensity adopting the expectation maximization em algorithm for use in computing the maximum a posteriori map estimate corresponding to our model we find that our model permits remarkably simple closed form expressions for the em update equations the behavior of our em algorithm is examined and it is shown that convergence to the global map estimate can be guaranteed applications in emission computed tomography and astronomical energy spectral analysis demonstrate the potential of the new approach

iterative reweighted total generalized variation based poisson noise removal model total generalized variation tgv regularization model is one of the most effective methods for denoising and eliminating staircase effect however the tgv regularization model tends to blur edges as the existence of high order derivative in order to avoid the staircase effect while alleviating the edge blurring an iterative reweighted tgv based poisson noise removal model is presented under the assumption that each pixel of noisy image follows a poisson distribution the weight function incorporated in the tgv regularization term is derived from the expectation maximization em algorithm we design a new iterative weighted primal dual algorithm which is an improvement of the classic iterative reweighted algorithm numerical experimental results show the better performance of our model in removing noise effectively while preserving edges and eliminating staircase effect

a banzhaf value for games with fuzzy communication structure computing the power of the political groups in the european parliament abstract in 2013 jimenez losada et al introduced several extensions of the myerson value for games with fuzzy communication structure in a fuzzy communication structure the membership of the players and the relations among them are leveled now we study a banzhaf value for these situations the myerson model is followed to define the fuzzy graph banzhaf value taking as base point the choquet integral we propose an axiomatization for this value introducing leveled amalgamation of players an algorithm to calculate this value is provided and its complexity is studied finally we show an applied example computing by this fuzzy value the power of the groups in the european parliament

max consistency complement consistency and the core of fuzzy games recently hwang introduced two extensions of the max reduced game to fuzzy games by reducing the number of the players based on these reduced games he offered analogous axiomatizations of the core related to serrano and volij in the context of fuzzy games here we continue and develop hwang s work on similar topics however we turn to a different definition of the reduced game by simultaneously reducing both the number of the players and the participation levels we propose such extensions of the complement reduced game and of the max reduced game to fuzzy games and define the related properties of consistency and converse consistency based on these properties we offer several analogous characterizations of the core related to peleg serrano and volij and tadenuma respectively

adapting to unknown smoothness via wavelet shrinkage abstract we attempt to recover a function of unknown smoothness from noisy sampled data we introduce a procedure sureshrink that suppresses noise by thresholding the empirical wavelet coefficients the thresholding is adaptive a threshold level is assigned to each dyadic resolution level by the principle of minimizing the stein unbiased estimate of risk sure for threshold estimates the computational effort of the overall procedure is order n log n as a function of the sample size n sureshrink is smoothness adaptive if the unknown function contains jumps then the reconstruction essentially does also if the unknown function has a smooth piece then the reconstruction is essentially as smooth as the mother wavelet will allow the procedure is in a sense optimally smoothness adaptive it is near minimax simultaneously over a whole interval of the besov scale the size of this interval depends on the choice of mother wavelet we know from a previous paper by the authors that traditional smoot

bayesian multiscale models for poisson processes abstract i introduce a class of bayesian multiscale models bmsm s for one dimensional inhomogeneous poisson processes the focus is on estimating the discretized intensity function underlying the process unlike the usual transform based approach at the heart of most wavelet based methods for gaussian data these bmsm s are constructed using recursive dyadic partitions rdp s within an entirely likelihood based framework each rdp may be associated with a binary tree and a new multiscale prior distribution is introduced for the unknown intensity through the placement of mixture distributions at each of the nodes of the tree the concept of model mixing is then applied to a complete collection of such trees in addition to allowing for the inclusion of full location scale information in the model this last step also is fundamental both in inducing stationarity in the prior distribution and in enabling a given intensity function to be approximated at the resolution of the data under squared error lo

an algorithm for computing the nucleolus of disjunctive non negative additive games with an acyclic permission structure a cooperative game with a permission structure describes a situation in which players in a cooperative tu game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate in this paper we consider non negative additive games with an acyclic permission structure for such a game we provide a polynomial time algorithm for computing the nucleolus of the induced restricted game the algorithm is applied to a market situation where sellers can sell objects to buyers through a directed network of intermediaries

iterative shrinkage approach to restoration of optical imagery the problem of reconstruction of digital images from their degraded measurements is regarded as a problem of central importance in various fields of engineering and imaging sciences in such cases the degradation is typically caused by the resolution limitations of an imaging device in use and or by the destructive influence of measurement noise specifically when the noise obeys a poisson probability law standard approaches to the problem of image reconstruction are based upon using fixed point algorithms which follow the methodology first proposed by richardson and lucy the practice of using these methods however shows that their convergence properties tend to deteriorate at relatively high noise levels accordingly in the present paper a novel method for denoising and or deblurring of digital images corrupted by poisson noise is introduced the proposed method is derived under the assumption that the image of interest can be sparsely represented in the domain of a linear transform consequently a shrinkage based iterative procedure is proposed which guarantees the solution to converge to the global maximizer of an associated maximum a posteriori criterion it is shown in a series of computer simulated experiments that the proposed method outperforms a number of existing alternatives in terms of stability precision and computational efficiency

a linear wavelet filter for parametric imaging with dynamic pet describes a new filter for parametric images obtained from dynamic positron emission tomography pet studies the filter is based on the wavelet transform following the heuristics of a previously published method that are here developed into a rigorous theoretical framework it is shown that the space time problem of modeling a dynamic pet sequence reduces to the classical one of estimation of a normal multivariate vector of independent wavelet coefficients that under least squares risk can be solved by straightforward application of well established theory from the study of the distribution of wavelet coefficients of pet images it is inferred that a james stein linear estimator is more suitable for the problem than traditional nonlinear procedures that are incorporated in standard wavelet filters this is confirmed by the superior performance of the james stein filter in simulation studies compared to a state of the art nonlinear wavelet filter and a nonstationary filter selected from literature finally the formal framework is interpreted for the practitioner s point of view and advantages and limitations of the method are discussed

cooperative fuzzy games we derive versions of known results dealing with core equilibria and shapley values of cooperative games in the case of cooperative fuzzy games i e games defined on fuzzy subsets of the set of n players a fuzzy coalition is an n vector i associating with each player i his rate of participation i 0 1 in the fuzzy coalition and the real number v is the coalition worth assumed to be positively homogeneous if also v is superadditive or equivalently concave the fuzzy game with side payments has a nonempty core associated with the coalition worth function for any ordinary game with side payments is a fuzzy extension thereof viz the fuzzy game whose coalition worth function is the least positively homogeneous superadditive function majorizing the coalition worth function of the original game the fuzzy extension always has a nonempty core moreover if the original game has a nonempty core it coincides with that of its fuzzy extension analogous results are established for games without side payments an axiomatization of values of fuzzy games with side payments is also given the results are applied to show that the set of walras equilibria coincides with the fuzzy core of an economy

cores of fuzzy games and their convexity in this paper the proper core and dominance core of a fuzzy game are introduced to guarantee equality between the proper core and the dominance core some mild conditions are provided another important issue for the convexity of the dominance core is also addressed

wavelets ridgelets and curvelets for poisson noise removal in order to denoise poisson count data we introduce a variance stabilizing transform vst applied on a filtered discrete poisson process yielding a near gaussian process with asymptotic constant variance this new transform which can be deemed as an extension of the anscombe transform to filtered data is simple fast and efficient in very low count situations we combine this vst with the filter banks of wavelets ridgelets and curvelets leading to multiscale vsts ms vsts and nonlinear decomposition schemes by doing so the noise contaminated coefficients of these ms vst modified transforms are asymptotically normally distributed with known variances a classical hypothesis testing framework is adopted to detect the significant coefficients and a sparsity driven iterative scheme reconstructs properly the final estimate a range of examples show the power of this ms vst approach for recovering important structures of various morphologies in very low count images these results also demonstrate that the ms vst approach is competitive relative to many existing denoising methods

games on fuzzy communication structures with choquet players myerson 1977 used graph theoretic ideas to analyze cooperation structures in games in his model he considered the players in a cooperative game as vertices of a graph which undirected edges defined their communication possibilities he modified the initial games taking into account the graph and he established a fair allocation rule based on applying the shapley value to the modified game now we consider a fuzzy graph to introduce leveled communications in this paper players play in a particular cooperative way they are always interested first in the biggest feasible coalition and second in the greatest level choquet players we propose a modified game for this situation and a rule of the myerson kind

spatially adaptive estimation via fitted local likelihood techniques this paper offers a new technique for spatially adaptive estimation the local likelihood is exploited for nonparametric modeling of observations and estimated signals the approach is based on the assumption of a local homogeneity of the signal for every point there exists a neighborhood in which the signal can be well approximated by a constant the fitted local likelihood statistics are used for selection of an adaptive size and shape of this neighborhood the algorithm is developed for a quite general class of observations subject to the exponential distribution the estimated signal can be uni and multivariable we demonstrate a good performance of the new algorithm for image denoising and compare the new method versus the intersection of confidence interval ici technique that also exploits a selection of an adaptive neighborhood for estimation

nontransferable utility games with fuzzy coalition restrictions abstract a value for nontransferable utility ntu games with fuzzy coalition restrictions is introduced and characterized in a similar way as the shapley value for transferable utility tu games has been extended in the literature to study games with restricted cooperation we extend the shapley ntu value to deal with ntu games in situations in which there are fuzzy dependency relationships among the players

reducing the number of linear programs needed for solving the nucleolus problem of n person game theory abstract the algorithm for finding the nucleolus of a cooperative n person game introduced by sankaran is compared to an earlier procedure by behringer it turns out that the latter is in every respect the superior one in both concepts the computation of the nucleolus is reduced to the solution of a finite sequence of linear programs their number is o 2n a method of reducing the number of linear programs to o n while not changing their size will be introduced

existence of fuzzy prekernels and mas colell bargaining sets in tu games abstract in this paper we first prove the existence of fuzzy prekernels and fuzzy nucleolus in tu fuzzy games which generalize the corresponding results for classical tu games as an application we apply the existence of fuzzy prekernels to derive an existence theorem for mas colell fuzzy bargaining sets and a stronger existence theorem for mas colell bargaining sets than the one by vohra 1991 18 we also provide an axiomatization theorem for fuzzy prekernels

the equal allocation of nonseparable costs an extension under fuzzy behavior by considering the players and the activity levels simultaneously we propose a consistent solution which is a generalization of the equal allocation of nonseparable costs eansc on fuzzy games we also adopt two pre existing concepts from traditional game theory and reinterpret them in the framework of fuzzy games first based on the consistency which related to an extended reduced game we offer two axiomatizations of the extended eansc second by applying the excess function we propose a dynamic process to illustrate that the extended eansc can be reached by players who start from an arbitrary efficient solution and make consecutive amendments

restoration of poissonian images using alternating direction optimization much research has been devoted to the problem of restoring poissonian images namely for medical and astronomical applications however the restoration of these images using state of the art regularizers such as those based upon multiscale representations or total variation is still an active research area since the associated optimization problems are quite challenging in this paper we propose an approach to deconvolving poissonian images which is based upon an alternating direction optimization method the standard regularization or maximum a posteriori map restoration criterion which combines the poisson log likelihood with a nonsmooth convex regularizer log prior leads to hard optimization problems the log likelihood is nonquadratic and nonseparable the regularizer is nonsmooth and there is a nonnegativity constraint using standard convex analysis tools we present sufficient conditions for existence and uniqueness of solutions of these optimization problems for several types of regularizers total variation frame based analysis and frame based synthesis we attack these problems with an instance of the alternating direction method of multipliers admm which belongs to the family of augmented lagrangian algorithms we study sufficient conditions for convergence and show that these are satisfied either under total variation or frame based analysis and synthesis regularization the resulting algorithms are shown to outperform alternative state of the art methods both in terms of speed and restoration accuracy

the general prenucleolus of n person cooperative fuzzy games abstract in this paper we define the concept of the general prenucleolus minimizing the player complaint vector in the lexicographic order over the preimputation set for the cooperative games with fuzzy coalitions for the general prenucleolus we get a sufficient condition that the complaints of all players are in equal amount under the case of linear complaint functions concluding the proposed player excess sakawa and nishizaki 1994 15 as a result we can obtain the proposed fuzzy solutions with the corresponding linear complaint functions such as the equalizer solution molina and tejada 2002 5 and shapley function etc we prove that the least square general prenucleolus minimizing the variance of the resulting player complaints is the general prenucleolus thus an optimal solution considered from two aspects of the lexicographic order and the least square criterion is obtained in addition several general prenucleoli are proposed in terms of specific situations

bayesian inference on multiscale models for poisson intensity estimation applications to photon limited image denoising we present an improved statistical model for analyzing poisson processes with applications to photon limited imaging we build on previous work adopting a multiscale representation of the poisson process in which the ratios of the underlying poisson intensities rates in adjacent scales are modeled as mixtures of conjugate parametric distributions our main contributions include 1 a rigorous and robust regularized expectation maximization em algorithm for maximum likelihood estimation of the rate ratio density parameters directly from the noisy observed poisson data counts 2 extension of the method to work under a multiscale hidden markov tree model hmt which couples the mixture label assignments in consecutive scales thus modeling interscale coefficient dependencies in the vicinity of image edges 3 exploration of a 2 d recursive quad tree image representation involving dirichlet mixture rate ratio densities instead of the conventional separable binary tree image representation involving beta mixture rate ratio densities and 4 a novel multiscale image representation which we term poisson haar decomposition that better models the image edge structure thus yielding improved performance experimental results on standard images with artificially simulated poisson noise and on real photon limited images demonstrate the effectiveness of the proposed techniques

on the computational complexity of coalitional resource games we study coalitional resource games crgs a variation of qualitative coalitional games qcgs in which each agent is endowed with a set of resources and the ability of a coalition to bring about a set of goals depends on whether they are collectively endowed with the necessary resources we investigate and classify the computational complexity of a number of natural decision problems for crgs over and above those previously investigated for qcgs in general for example we show that the complexity of determining whether conflict is inevitable between two coalitions with respect to some stated resource bound i e a limit value for every resource is co np complete we then investigate the relationship between crgs and qcgs and in particular the extent to which it is possible to translate between the two models we first characterise the complexity of determining equivalence between crgs and qcgs we then show that it is always possible to translate any given crg into a succinct equivalent qcg and that it is not always possible to translate a qcg into an equivalent crg we establish some necessary and some sufficient conditions for a translation from qcgs to crgs to be possible and show that even where an equivalent crg exists it may have size exponential in the number of goals and agents of its source qcg

solutions for fuzzy matrix games in this paper we deal with two person zero sum games with fuzzy payoffs and fuzzy goals we have presented two models for studying two person zero sum matrix games with fuzzy payoffs and fuzzy goals we assume that each player has a fuzzy goal for each of the payoffs we obtained that the fuzzy relation approach and the max min solution are equivalent

solution of the delayed single degree of freedom system equation by exponential matrix method in this paper an exponential collocation method for the solution linear delay differential equations with constant delay is presented the utility of this matrix based method is that it is very systematic and by writing a maple program any type of second order linear differential delay equation can be solved easily the method is applied to three different types of delay equations linear oscillator with delay i in the restoring force term ii in the damping term and iii in the acceleration term time response curves have been plotted for each type and the effect of the parameters of the delay terms has been shown an error analysis based on residual function is carried out to show the accuracy of the results

linear quadratic uncertain differential game with application to resource extraction problem uncertain differential game investigates interactive decision making of players over time and the system dynamics is described by an uncertain differential equation this paper goes further to study the two player zero sum uncertain differential game in order to guarantee the saddle point nash equilibrium a max min theorem is provided furthermore when the system dynamics is described by a linear uncertain differential equation and the performance index function is quadratic the existence of saddle point nash equilibrium is obtained via the solvability of a corresponding riccati equation finally a resource extraction problem is analyzed by using the theory proposed in this paper

fuzzy games a characterization of the core in this paper we extend to the cooperative fuzzy games case the reduced game introduced by davis and maschler the kernel of a cooperative game naval res logist quart 12 1965 223 259 we shall introduce two types of such a reduced game to cooperative fuzzy games and define the related properties of consistency and converse consistency we further offer two axiomatizations of the core on the domain of all cooperative fuzzy games by means of consistency and its converse