Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,464
result(s) for
"Selfishness"
Sort by:
Dealing with someone who is selfish
Discusses the nature and effects of selfishness and how to deal with someone who is selfish.
Book
Selfishness in Vehicular Delay-Tolerant Networks: A Review
Various operational communication models are using Delay-Tolerant Network as a communication tool in recent times. In such a communication paradigm, sometimes there are disconnections and interferences as well as high delays like vehicle Ad hoc networks (VANETs). A new research mechanism, namely, the vehicle Delay-tolerant network (VDTN), is introduced due to several similar characteristics. The store-carry-forward mechanism in VDTNs is beneficial in forwarding the messages to the destination without end-to-end connectivity. To accomplish this task, the cooperation of nodes is needed to forward messages to the destination. However, we cannot be sure that all the nodes in the network will cooperate and contribute their computing resources for message forwarding without any reward. Furthermore, there are some selfish nodes in the network which may not cooperate to forward the messages, and are inclined to increase their own resources. This is one of the major challenges in VDTNs and incentive mechanisms are used as a major solution. This paper presents a detailed study of the recently proposed incentive schemes for VDTNs. This paper also gives some open challenges and future directions for interested researchers in the future.
Journal Article
It's mine!
Three selfish frogs quarrel over who owns their pond and island, until a storm makes them value the benefits of sharing.
Book
Social Trust Confirmation-Based Selfish Node Detection Algorithm in Socially Aware Networks
Nodes in socially aware networks (SANs) may act selfishly on individual bases due to resource constraints and socially selfish behavior arising from the social preferences of nodes. In response to such selfish behaviors exhibited by nodes, this paper proposes a social trust confirmation-based selfish node detection algorithm (STCDA). This algorithm first utilizes a subjective forwarding willingness detection mechanism to discern selfishness. If a node’s energy is insufficient or its message rejection rate is too high—that is, the node cannot or is unwilling to forward messages—it indicates that the node is selfish. Otherwise, it is evaluated more thoroughly through the node’s social trust detection mechanisms. It calculates the social trust level of nodes based on the benefits of forwarding messages, thereby distinguishing between individually selfish nodes and socially selfish nodes in the network. If further evaluation is needed, the final judgment will be made using the message confirmation feedback detection mechanism. This checks the message information forwarded by nodes in the network. If nodes fail to forward messages after receiving them—excluding reasons such as message expiration or temporary insufficient cache space—it indicates that the nodes are selfish. Results from experimental simulations show that this algorithm performs better than traditional algorithms. Under conditions of 80% selfish nodes, a message TTL of 300 min, and 10 MB of cache space, it improves the message delivery rate by 5.87% and reduces the average delay by 6.2% compared to the existing comprehensive confirmation-based selfish node detection algorithm.
Journal Article
The marvel of martyrdom : the power of self-sacrifice in a selfish world
\"This text examines the psychological effects of martyrdom and martyrs across the world. The authors discuss martyrdom and martyrs through the lens of current events, iconic historical figures, and popular culture\"-- Provided by publisher.
Book
Resource-Constrained and Socially Selfish-Based Incentive Algorithm for Socially Aware Networks
In
Socially Aware Networks
(SANs), nodes exhibit some degree of individual selfishness and social selfishness because of their limited resources and the strength of social relationships, which affects network performance. Therefore, this paper proposes a
Resource-Constrained and Socially Selfish-Based Incentive Algorithm
(RSIA), which employs the payment of virtual currencies to intermediate nodes as rewards to incentivize them to forward messages. At the same time, nodes can have a preference for selfishness due to the high affluence of their wealth. For the selfish preference of highly affluent nodes that do not participate in message cooperative forwarding, the service level of the node will be reduced as a punishment. So, the nodes’ resource status and social relationship, and service level are considered to price the message, and the message forwarding is done by consensus through a bargaining game. Secondly, this paper introduces a security module and an encryption mechanism to prevent false offers from the nodes. Finally, the results of simulation experiments indicate that the RSIA algorithm improves the delivery rate of messages with effect and improves in terms of average latency.
Journal Article
The fate of Fausto : a painted fable
A selfish man sets out to prove that he is the boss of everything he surveys.
Book
The Berenstain Bears get the gimmies
Gran and Gramps come up with a plan to help selfish Brother and Sister Bear get rid of a bad case of the galloping greedy gimmies.
Book
On the Psychology of Scarcity
Consumers often encounter reminders of resource scarcity. However, relatively little is known about the psychological processes that such reminders instantiate. In this article, we posit that reminders of resource scarcity activate a competitive orientation, which guides consumers’ decision making towards advancing their own welfare. Further, we reveal that this tendency can manifest in behaviors that appear selfish, but also in behaviors that appear generous, in conditions where generosity allows for personal gains. The current research thus offers a more nuanced understanding of why resource scarcity may promote behaviors that appear either selfish or generous in different contexts, and provides one way to reconcile seemingly conflicting prior findings.
Journal Article