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.
In this paper, targeting the trade between China and the United States as the research object, we use the Poisson model and the game analysis method to do the empirical fitting of the anti-dumping trend. Based on the results, this paper argues that US anti-dumping investigations toward China tend to normalize, and this trend of normalization will exist for a long time. This trend will have an important...
In the past few years, cloud computing has emerged as one of the most influential paradigms in the IT industry. As promising as it is, this paradigm brings forth many new challenges for data security because users have to outsource sensitive data on untrusted cloud servers for sharing. In this paper, to guarantee the confidentiality and security of data sharing in cloud environment, we propose a Flexible...
In an artificial financial market without real growth, extreme income inequality produces extreme wealth inequality via accumulation. An agent-based model is built to study to what extent a strong tax policy can affect this process. Wealth effect is defined as a positive impact of current wealth on future wealth growth. When wealth effect exists, the appearance of extreme wealth inequality is inevitable.
The self-interest of agents in strategic networks, i.e. networks where self-interested agents interact, leads to intrinsic incentive problems which impact the stability and efficiency of such networks. This paper propose the first game-theoretic framework for analyzing and understanding how strategic networks are formed endogenously, driven by the self-interested decisions of individual agents aiming...
Our objective is to develop an approach for quantifying the vulnerability of a food product supply chain that may be used by an intelligent adversary to deliver a chemical or biological agent. The approach is intended to create control strategies that seek to ensure a high level of system productivity while mitigating risk. We have developed a supply chain process model that determines the consequence...
Crowdsourcing websites (e.g. Yahoo! Answers, Amazon Mechanical Turk, and etc.) emerged in recent years that allow requesters from all around the world to post tasks and seek help from an equally global pool of workers. However, intrinsic incentive problems reside in crowdsourcing applications as workers and requester are selfish and aim to strategically maximize their own benefit. In this paper, we...
This paper focuses on analyzing the interactions emerging between users in online communities. Network utility maximization and other methods are not effective when the communities are composed of intelligent and self-interested users (multimedia social communities, social networks etc.), because the interests of the individual users may be in conflict. In our prior work, we propose to design protocols...
The design of incentive schemes for P2P multimedia sharing networks is challenging due to the unique features exhibited by such networks: large populations of anonymous peers interacting infrequently, asymmetric interests of peers, network errors, and multiple concurrent transactions. In this paper, we design and rigorously analyze a new family of incentive protocols that utilizes social norms for...
In this paper, we build an analytical framework for the design and analysis of a new family of social norm based incentive mechanisms for peer-to-peer (P2P) networks. With this framework, we provide conditions on network parameters under which we can construct social norm equilibrium that induces peers to contribute their resources in their self-interest. Using an illustrative example of a social...
We start by formulating the resource sharing in peer-to-peer (P2P) networks as a random-matching gift-giving game, where self-interested peers aim at maximizing their own long-term utilities. In order to provide incentives for the peers to voluntarily share their resources, we propose to design protocols that operate according to pre-determined social norms. To optimize their long-term performance...
In this paper, we study the interactions between two Secondary Wireless Service Providers (WSPs) in different situations: competitive and cooperative. WSPs acquire spectrum by leasing from spectrum broker and then sell spectrum to secondary users by providing services. Users follow Wardrop's principle and choose WSPs with lowest perceived price which is associated with price and quality of service...
This paper studies the problem that how social norms emerge even though agents are selfish and attempt to only maximize their own utility. We propose a new rule for social interactions. The rule is called Highest Rewarding Neighborhood (HRN). The HRN rule allows agents to remain selfish and be able to break relationships in order to maximize their utility. Our experiment shows that when agents are...
This paper proposed a pursuit-evasion algorithm based on the Option method from hierarchical reinforcement learning and applied it into multi-robot pursuit-evasion game in 2D-Dynamic environment. The algorithm efficiency is studied by comparing it with Q-learning. We decompose the complex task with option method, and divide the learning process into two parts: High-level learning and Low-level learning,...
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.