Sustainability for utility allocation: a game-theoretical mechanism

Author(s):  
Hui-Chuan Wei ◽  
Ai-Tzu Li ◽  
Wei-Ni Wang ◽  
Yu-Hsien Liao

 By focusing on various influences arose from environmental change, sustainability has become a major conception among many fields, including utility allocation. On the other hand, game-theoretical methods have always been adopted to analyze the reasonability of utility allocation rules. In many real-world situations, however, participants and its energetic levels (decisions) should be essential factors simultaneously. By focusing on both the participants and its energetic levels (decisions), we introduce the restrained core to investigate utility allocation under fuzzy transferable-utility (TU) models. In order to analyze the reasonability for the restrained core, two axiomatic results are further provided by applying several types of reductions. Since the restrained core infringes a specific converse steadiness property, a converse steady enlargement of the restrained core is also introduced to investigate how extensive the violation of this specific converse steadiness property is. This converse steady enlargement is smallest converse steady measuration that contains the restrained core.

2021 ◽  
Vol 13 (3) ◽  
pp. 1528
Author(s):  
En-Cheng Chi ◽  
Yu-Hsien Liao

Recently, game-theoretical methods have been adopted to analyze the reasonability of usability distribution mechanisms. On the other hand, sustainability has become a major conception among many fields by focusing on various influences that arose from environmental change, including usability distribution under multi-attribute sports management schemes. In many real-world situations, however, performers and its energy levels (strategies) should be essential factors simultaneously. Based on maximal-usability among energy level (strategy) vectors, we define an output, its efficacious extension and normalization to analyze usability distribution mechanisms under multi-attribute sports management schemes. We also adopt axiomatic processes to present the reasonability for these outputs. By considering reduced scheme and excess mapping, we adopt alternative formulation to offer dynamic processes for the efficacious extension and the normalization, respectively.


Mathematics ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 617
Author(s):  
Yu-Hsien Liao

In many interactive environments, operators may have to deal with different work objectives at the same time. In a realistic context, such as differences in the target type to be addressed, or changes in the behavior of other operators, operators may therefore have to cope with by adopting different work levels (strategies) at any given time. On the other hand, the importance or influence brought by operators may vary depending on many subjective and objective factors, such as the size of the constituency represented by a congressman, and the bargaining power of a business personnel which may vary. Therefore, it is reasonable that weights are apportioned to operators and arbitrary usability should be distributed according to these weights under various working levels and multiattribute situations. In pre-existing results for allocation rules, weights might be always apportioned to the “operators” or the “levels” to modify the differences among the operators or its working levels respectively. By applying weights to the operators and its working levels (strategies) simultaneously, we adopt the maximal marginal variations among working level (strategy) vectors to propose an allocation rule under multiattribute situations. Furthermore, we introduce some axiomatic outcomes to display the rationality for this weighted allocation rule. By replacing weights to be maximal marginal variations, a generalized index is also introduced.


2011 ◽  
Vol 10 (01) ◽  
pp. 73-99 ◽  
Author(s):  
PATRICK F. SMITH

Let R be a ring with identity. A unital left R-module M has the min-property provided the simple submodules of M are independent. On the other hand a left R-module M has the complete max-property provided the maximal submodules of M are completely coindependent, in other words every maximal submodule of M does not contain the intersection of the other maximal submodules of M. A semisimple module X has the min-property if and only if X does not contain distinct isomorphic simple submodules and this occurs if and only if X has the complete max-property. A left R-module M has the max-property if [Formula: see text] for every positive integer n and distinct maximal submodules L, Li (1 ≤ i ≤ n) of M. It is proved that a left R-module M has the complete max-property if and only if M has the max-property and every maximal submodule of M/Rad M is a direct summand, where Rad M denotes the radical of M, and in this case every maximal submodule of M is fully invariant. Various characterizations are given for when a module M has the max-property and when M has the complete max-property.


2017 ◽  
Vol 80 (1) ◽  
Author(s):  
Adam Glaz

Grounded in a rich philosophical and semiotic tradition, the most influential models of the linguistic sign have been Saussure’s intimate connection between the signifier and the signi-fied and Ogden and Richards’ semiotic triangle. Within the triangle, claim the cognitive lin-guists Radden and Kövecses, the sign functions in a metonymic fashion. The triangular semi-otic model is expanded here to a trapezium and calibrated with, on the one hand, Peirce’s conception of virtuality, and on the other hand, with some of the tenets of Langacker’s Cogni-tive Grammar. In conclusion, the question “How does the linguistic sign mean?” is answered thus: it means by virtue of the linguistic form activating (virtually) the entire trapezium-like configuration of forms, concepts, experienced projections, and relationships between all of the above. Activation of the real world remains dubious or indirect. The process is both meto-nymic and virtual, in the sense specified.


Author(s):  
BARTOLOMIEJ SKOWRON ◽  

From an ontological point of view, virtuality is generally considered a simulation: i.e. not a case of true being, and never more than an illusory copy, referring in each instance to its real original. It is treated as something imagined — and, phenomenologically speaking, as an intentional object. It is also often characterized as fictive. On the other hand, the virtual world itself is extremely rich, and thanks to new technologies is growing with unbelievable speed, so that it now influences the real world in quite unexpected ways. Thus, it is also sometimes considered real. In this paper, against those who would regard virtuality as fictional or as real, I claim that the virtual world straddles the boundary between these two ways of existence: that it becomes real. I appeal to Roman Ingarden’s existential ontology to show that virtual objects become existentially autonomous, and so can be attributed a form of actuality and causal efficaciousness. I conclude that the existential autonomy and actuality of virtual objects makes them count as real objects, but also means that they undergo a change in their mode of existence.


Author(s):  
Douglas Walton

Formal logic abstracts the form of an argument from an instance of it that may be encountered, and then evaluates the form as being valid or invalid. The form is the important thing, rather than the concrete instance of the form. Informal logic, on the other hand, evaluates how an argument is used in a given context of conversation. This more practical, real-world orientation requires more judgment in interpreting what a given text of discourse should be taken to argue.


2000 ◽  
Vol 15 (1) ◽  
pp. 1-10 ◽  
Author(s):  
CARLA P. GOMES

Both the Artificial Intelligence (AI) and the Operations Research (OR) communities are interested in developing techniques for solving hard combinatorial problems, in particular in the domain of planning and scheduling. AI approaches encompass a rich collection of knowledge representation formalisms for dealing with a wide variety of real-world problems. Some examples are constraint programming representations, logical formalisms, declarative and functional programming languages such as Prolog and Lisp, Bayesian models, rule-based formalism, etc. The downside of such rich representations is that in general they lead to intractable problems, and we therefore often cannot use such formalisms for handling realistic size problems. OR, on the other hand, has focused on more tractable representations, such as linear programming formulations. OR-based techniques have demonstrated the ability to identify optimal and locally optimal solutions for well-defined problem spaces. In general, however, OR solutions are restricted to rigid models with limited expressive power. AI techniques, on the other hand, provide richer and more flexible representations of real-world problems, supporting efficient constraint-based reasoning mechanisms as well as mixed initiative frameworks, which allow the human expertise to be in the loop. The challenge lies in providing representations that are expressive enough to describe real-world problems and at the same time guaranteeing good and fast solutions.


2015 ◽  
Vol 100 (1) ◽  
pp. 65-77 ◽  
Author(s):  
JERZY DYDAK

This paper is devoted to dualization of paracompactness to the coarse category via the concept of $R$-disjointness. Property A of Yu can be seen as a coarse variant of amenability via partitions of unity and leads to a dualization of paracompactness via partitions of unity. On the other hand, finite decomposition complexity of Guentner, Tessera, and Yu and straight finite decomposition complexity of Dranishnikov and Zarichnyi employ $R$-disjointness as the main concept. We generalize both concepts to that of countable asymptotic dimension and our main result shows that it is a subclass of spaces with Property A. In addition, it gives a necessary and sufficient condition for spaces of countable asymptotic dimension to be of finite asymptotic dimension.


1973 ◽  
Vol 20 (1) ◽  
pp. 5-9
Author(s):  
George F. Green

Mature students of mathematics can readily cope with new and abstract terms if precise definitions of the terms are provided. For such students, neither the new term nor its definition needs to have any obvious connection with the real world. Most young children, on the other hand, require relatively clear associations between abstract terms and physical reality. Making these associations is the role of pedagogical models. The word model has many meanings in mathematics and elsewhere, but it is used here simply to mean an assignment of meaning to an abstraction, in familiar—frequently physical—terms. The child's model, then, is somewhat analogous to the mathematician's definition.


2019 ◽  
Vol 29 (1) ◽  
pp. 207-223
Author(s):  
Stefano Brusoni ◽  
Daniella Laureiro-Martínez ◽  
Nicola Canessa ◽  
Maurizio Zollo

Abstract In this article we argue that in order to understand failure or success in adapting to environmental change, we should better understand why people hesitate to pursue novel choices. This article asks: what forces hinder individuals’ exploration choices of different alternatives, and hence their ability to learn from them? To answer this question, this article looks to the cognitive sciences to identify a set of plausible mechanisms that hinder people’s tendency to explore. So far, “exploration” has been studied as a relatively monolithic behavior. Instead, we propose that exploration can be characterized in terms of some distinctive forces behind it. On one hand, agents experience “attachment” to choices that proved successful in the past, and hence comfort when sticking with them. On the other hand, they also experience concerns about less familiar options, as they lack knowledge about “distant” choices that have not been tried for a long time, or ever. We propose that high attachment is related to anxiety, and high distance to fear. Both these negative affective states hinder exploration. We find and discuss preliminary and tentative evidence of this effect.


Sign in / Sign up

Export Citation Format

Share Document