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.
Crowdsourcing is a promising paradigm to accomplish a complex task via eliciting services from a large group of contributors. However, recent observations indicate that the success of crowdsourcing is being threatened by the malicious behaviors of the contributors. In this paper, we analyze the malicious attack problem using an iterated prisoner’s dilemma (IPD) game and propose a zero-determinant...
Recent studies have modeled the incentive mechanism as a complete information game where the contributors have common knowledge. However, that assumption is not realistic in real world scenarios. In this paper, we present an incentive mechanism for CS in sealed markets in which participants have incomplete information on other participants' behavior. An iterative game framework is introduced where...
Group-oriented services such as group recommendations aim to provide services for a group of users. For these applications, how to aggregate the preferences of different group members is the toughest yet most important problem. Inspired by game theory, in this paper, we propose to explore the idea of Nash equilibrium to simulate the selections of members in a group by a game process. Along this line,...
Stability analysis is an important research direction in evolutionary game theory. Evolutionarily stable states have a close relationship with Nash equilibria of repeated games, which are characterized by the folk theorem. When applying the folk theorem, one needs to compute the minimax profile of the game in order to find Nash equilibria. Computing the minimax profile is an NP-hard problem. In this...
We prove that finding a Nash equilibrium of a game is hard, assuming the existence of indistinguishability obfuscation and one-way functions with sub-exponential hardness. We do so by showing how these cryptographic primitives give rise to a hard computational problem that lies in the complexity class PPAD, for which finding Nash equilibrium is complete. Previous proposals for basing PPAD-hardness...
We propose adding a vigilante player and using non-traditional game strategy for decision making to improve the performance of a cognitive radio network. To date, the application to cognitive radio networks of a hybrid player such as a vigilante, which is both cooperative and non- cooperative, has not been significantly studied. We use a novel play strategy (i.e., altruism) to police a wireless network...
Trust negotiation is the process of revealing the certificates and the strategy set of the resource requester and the resource provider with each other, while after negotiation succeeding cache selectively the sequence of revealing the certificates according to the their use ratio and showing directly at the next time, which can save plenty of time costing. This paper makes a split of the negotiation...
Because of nodes in P2P networks are self-organization, part of nodes in P2P networks appear selfish and P2P sharing of network resources do not achieve the desired efficiency. This paper presents an incentive mechanism based on game theory integrate with Mixed Strategy Nash Equilibrium, it is used to detect selfish nodes in P2P networks and urge them to join the network nodes consciously. Finally,...
Equilibria computation is of great importance to many areas such as economics, control theory, and recently computer science. We focus on the computation of Nash equilibria in two-player general-sum normal form games, also called bimatrix games. One efficient method to compute these equilibria is based on enumerating the vertices of the best response polyhedrons of the two players and checking the...
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.