An intelligent-optimal control scheme for unknown nonaffine nonlinear discrete-time systems with discount factor in the cost function is developed in this paper. The iterative adaptive dynamic programming algorithm is...
详细信息
An intelligent-optimal control scheme for unknown nonaffine nonlinear discrete-time systems with discount factor in the cost function is developed in this paper. The iterative adaptive dynamic programming algorithm is introduced to solve the optimal control problem with convergence analysis. Then, the implementation of the iterative algorithm via globalized dual heuristic programming technique is presented by using three neural networks, which will approximate at each iteration the cost function, the control law, and the unknown nonlinear system, respectively. In addition, two simulation examples are provided to verify the effectiveness of the developed optimal control approach. (C) 2012 Elsevier Ltd. All rights reserved.
Despite the tremendous commercial success of generalized second-price (GSP) keyword auctions, it still remains a big challenge for an advertiser to formulate an effective bidding strategy. In this paper, we strive to ...
详细信息
Despite the tremendous commercial success of generalized second-price (GSP) keyword auctions, it still remains a big challenge for an advertiser to formulate an effective bidding strategy. In this paper, we strive to bridge this gap by proposing a framework for studying pure-strategy Nash equilibria in GSP auctions. We first analyze the equilibrium bidding behaviors by investigating the properties and distribution of all pure-strategy Nash equilibria. Our analysis shows that the set of all pure-strategy Nash equilibria of a GSP auction can be partitioned into separate convex polyhedra based on the order of bids if the valuations of all advertisers are distinct. We further show that only the polyhedron that allocates slots efficiently is weakly stable, thus allowing all inefficient equilibria to be weeded out. We then propose a novel refinement method for identifying a set of equilibria named the stable Nash equilibrium set (STNE) and prove that STNE is either the same as or a proper subset of the set of the well-known symmetrical Nash equilibria. These findings free both auctioneers and advertisers from complicated strategic thinking. The revenue of a GSP auction on STNE is at least the same as that of the classical Vickrey-Clarke-Groves mechanism and can be used as a benchmark for evaluating other mechanisms. At the same time, STNE provides advertisers a simple yet effective and stable bidding strategy.
In this paper, a neuro-optimal control scheme for a class of unknown discrete-time nonlinear systems with discount factor in the cost function is developed. The iterative adaptive dynamic programming algorithm using g...
详细信息
In this paper, a neuro-optimal control scheme for a class of unknown discrete-time nonlinear systems with discount factor in the cost function is developed. The iterative adaptive dynamic programming algorithm using globalized dual heuristic programming technique is introduced to obtain the optimal controller with convergence analysis in terms of cost function and control law. In order to carry out the iterative algorithm, a neural network is constructed first to identify the unknown controlled system. Then, based on the learned system model, two other neural networks are employed as parametric structures to facilitate the implementation of the iterative algorithm, which aims at approximating at each iteration the cost function and its derivatives and the control law, respectively. Finally, a simulation example is provided to verify the effectiveness of the proposed optimal control approach.
Click fraud (CF) has become a serious problem in the online advertising, making the anti-CF issue quite important. In this paper, we analyze the effects of the price determination model on the CF situations in online ...
详细信息
Listwise approaches are an important class of learning to rank, which utilizes automatic learning techniques to discover useful information. Most previous research on listwise approaches has focused on optimizing rank...
详细信息
Listwise approaches are an important class of learning to rank, which utilizes automatic learning techniques to discover useful information. Most previous research on listwise approaches has focused on optimizing ranking models using weights and has used imprecisely labeled training data; optimizing ranking models using features was largely ignored thus the continuous performance improvement of these approaches was hindered. To address the limitations of previous listwise work, we propose a quasi-KNN model to discover the ranking of features and employ rank addition rule to calculate the weight of combination. On the basis of this, we propose three listwise algorithms, FeatureRank, BL-FeatureRank, and DiffRank. The experimental results show that our proposed algorithms can be applied to a strict ordered ranking training set and gain better performance than state-of-the-art listwise algorithms.
To overcome public transportation problems during the 16th Asian Games held in Guanhzhou China, a PtMS (Parallel Transportation management System), a novel application of Intelligent Transportation systems, was introd...
详细信息
To overcome public transportation problems during the 16th Asian Games held in Guanhzhou China, a PtMS (Parallel Transportation management System), a novel application of Intelligent Transportation systems, was introduced for effective and convenient traffic management. Results show that PtMS has successfully enhanced public traffic management, raising it from experience-based policy formulation plus manual implementation to scientific computing-based policy generation plus implementation with intelligent systems.
Social causality is the inference an entity makes about the social behavior of other entities and self. Besides physical cause and effect, social causality involves reasoning about epistemic states of agents and coerc...
详细信息
Social causality is the inference an entity makes about the social behavior of other entities and self. Besides physical cause and effect, social causality involves reasoning about epistemic states of agents and coercive circumstances. Based on such inference, responsibility judgment is the process whereby one singles out individuals to assign responsibility, credit or blame for multi-agent activities. Social causality and responsibility judgment are a key aspect of social intelligence, and a model for them facilitates the design and development of a variety of multi-agent interactive systems. Based on psychological attribution theory, this paper presents a domain-independent computational model to automate social inference and judgment process according to an agent's causal knowledge and observations of interaction. We conduct experimental studies to empirically validate the computational model. The experimental results show that our model predicts human judgments of social attributions and makes inferences consistent with what most people do in their judgments. Therefore, the proposed model can be generically incorporated into an intelligent system to augment its social and cognitive functionality.
Actions are the primary way an entity interacts with other entities and acts on the external world. Action knowledge is of vital importance for behavior modeling, analysis and prediction in security informatics. In th...
详细信息
The micro-blogs, as a new social media, possesses big differences with other social media on the aspect of information updating frequency, organization structure, user connection and etc, which have astonishing power ...
详细信息
Budget-related decisions in search auctions are recognized as a structured decision problem, rather than a simple constraint. Budget planning over several coupled campaigns remains a challenging but utterly important ...
详细信息
Budget-related decisions in search auctions are recognized as a structured decision problem, rather than a simple constraint. Budget planning over several coupled campaigns remains a challenging but utterly important task in search advertisements. In this paper, we propose a multi-campaign budget plan- ning approach using optimal control techniques, with consideration of the substitute relationship between advertising campaigns. A measure of coupled relationships between campaigns is presented, e.g., the over- lapping degree (O) in terms of campaign contents, promotional periods and target regions. We also discuss some desirable properties of our model and possible solutions. Furthermore, computational experiments are conducted to evaluate our model and identified properties, with real-world data collected from logs and reports of practical campaigns. Experimental results show that, (a) coupled campaigns with higher over- lapping degrees can reduce the optimal budget level and the optimal revenue, and also arrive the budgeting cap earlier;(b) The advertising effort could be seriously weakened when ignoring the overlapping degree between campaigns.
暂无评论