{"title":"Incorporating Fairness into Infinitely Repeated Games with Conflicting Interests for Conflicts Elimination","authors":"Jianye Hao, Ho-fung Leung","doi":"10.1109/ICTAI.2012.50","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.50","url":null,"abstract":"In many multi-agent applications, game theory can serve as a useful tool to model these multi-agent scenarios and analyse the strategic interactions among agents. Fairness is an important goal to consider in a variety of multi-agent applications such as resource allocation or job scheduling problems, but it is not taken into consideration in traditional game theory. However, in many cases the solution concepts of pure strategy or mixed strategy Nash equilibria from traditional game theory can lead to unfair and inefficient outcomes. In this paper, we explicitly introduce the concept of fairness strategy in the context of infinitely repeated game inspired from fairness motive observed in human behaviors. We show that using fairness strategy, not only the agents can receive equal payoffs (achieving fairness) but also the sum of their payoffs is maximized (achieving efficiency) in the infinitely repeated games with conflicting interests. More importantly, we prove that this desirable pair of fairness strategies is in a new type of equilibrium - fairness strategy equilibrium, which thus provides an intuitive solution concept for the agents to make their decisions and coordinate with other agents or even humans.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122829934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Model Based Reinforcement Learning Approach Using On-Line Clustering","authors":"Nikolaos Tziortziotis, K. Blekas","doi":"10.1109/ICTAI.2012.101","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.101","url":null,"abstract":"A significant issue in representing reinforcement learning agents in Markov decision processes is how to design efficient feature spaces in order to estimate optimal policy. This particular study addresses this challenge by proposing a compact framework that employs an on-line clustering approach for constructing appropriate basis functions. Also, it performs a state-action trajectory analysis to gain valuable affinity information among clusters and estimate their transition dynamics. Value function approximation is used for policy evaluation in a least-squares temporal difference framework. The proposed method is evaluated in several simulated and real environments, where we took promising results.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129682528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Controlling the Production of Neuro-symbolic Rules","authors":"I. Hatzilygeroudis, J. Prentzas","doi":"10.1109/ICTAI.2012.148","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.148","url":null,"abstract":"Neurules are a kind of integrated rules integrating neurocomputing and production rules. Neurules can be produced from existing empirical data, through the neurules production algorithm (NPA). In this paper, we present (a) an extension to NPA regarding presentation of neurules, so that they are more natural and more informative, and (b) an experimental comparison of various alternative strategies we can use at some points of NPA targeting at producing as less neurules as possible. Results of (b) show no clear winner for all cases in terms of the gain in number of neurules compared to the computational cost.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129835700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Qualitative Spatial and Temporal Reasoning with Answer Set Programming","authors":"J. Li","doi":"10.1109/ICTAI.2012.87","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.87","url":null,"abstract":"Representing and reasoning spatial and temporal information is a key research issue in Computer Science and Artificial Intelligence. In this paper, we introduce tools that produce three novel encodings which translate problems in qualitative spatial and temporal reasoning into logic programs for answer set programming solvers. Each encoding reflects a different type of modeling abstraction. We evaluate our approach with two of the most well known qualitative spatial and temporal reasoning formalisms, the Interval Algebra and Region Connection Calculus. Our results show some surprising findings, including the strong performance of the solver for disjunctive logic programs over the non-disjunctive ones on our benchmark problems.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130156266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maximos A. Kaliakatsos-Papakostas, A. Floros, M. Vrahatis
{"title":"Intelligent Real-Time Music Accompaniment for Constraint-Free Improvisation","authors":"Maximos A. Kaliakatsos-Papakostas, A. Floros, M. Vrahatis","doi":"10.1109/ICTAI.2012.67","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.67","url":null,"abstract":"Computational Intelligence encompasses tools that allow the fast convergence and adaptation to several problems, a fact that makes them eligible for real-time implementations. The paper at hand discusses the utilization of intelligent algorithms (i.e. Differential Evolution and Genetic Algorithms) for the creation of an adaptive system that is able to provide real-time automatic music accompaniment to a human improviser. The main goal of the presented system is to generate accompanying music based on the local human musician's tonal, rhythmic and intensity playing style, incorporating no prior knowledge about the improvisers intentions. Compared to existing systems previously proposed, this work introduces a constraint-free improvisation environment where the most important musical characteristics are automatically adapted to the human performer's playing style, without any prior information. This fact allows the improviser to have maximal control over the tonal, rhythmic and intensity improvisation directions.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125578193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"DEC-A*: A Decentralized Multiagent Pathfinding Algorithm","authors":"Mohamad El Falou, M. Bouzid, A. Mouaddib","doi":"10.1109/ICTAI.2012.76","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.76","url":null,"abstract":"A* is the algorithm of finding the shortest path between two nodes in a graph. When the searching problem is constituted of a set of linked graphs, A* searches solution like if it is face of one graph formed by linked graphs. While researchers have developed solutions to reduce the execution time of A* in multiple cases by multiples techniques, we develop a new algorithm: DEC-A* which is a decentralized version of A* composing a solution through a collection of graph. A* uses a distance-plus-cost heuristic function to determine the order in which the search visits nodes in the tree. Our algorithm DEC-A* extends the evaluation of the distance-plus-cost heuristic to be the sum of two functions : local distance, which evaluates the cost to reach the nearest neighbor node s to the goal, and global distance which evaluates the cost from s to the goal through other graphs. DEC-A* reduces the time of finding the shortest path and reduces the complexity, while ensuring the privacy of graphs.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127700678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"EERtoOWL2: A Tool for Transforming RDB Data to OWL2 for Data Validation","authors":"Apichet Yajai, Gridaphat Sriharee","doi":"10.1109/ICTAI.2012.137","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.137","url":null,"abstract":"Data validation is an important task in order to ensure data quality. When the database has a complex data structure and, in addition, the data is changed by constraints related to the business of the database user, data validation can be a difficult task. This paper proposes the tool EERtoOWL2. The tool supports data validation using ontology reasoning. The relational database data is transformed into ontological data represented by OWL2. The transformation process relies on the Enhanced-Entity Relationship model. The tool validates the data and reports invalid data to the users. From the tool development, the OWL2 language has rich syntax and hence transformation of the relational database data into OWL2 is convenient. With ontology reasoning, the data validation process is efficient in detecting invalid data that may violate database integrity constraints as well as business/domain constraints.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129961489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jo Devriendt, B. Bogaerts, B. D. Cat, M. Denecker, Christopher Mears
{"title":"Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT","authors":"Jo Devriendt, B. Bogaerts, B. D. Cat, M. Denecker, Christopher Mears","doi":"10.1109/ICTAI.2012.16","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.16","url":null,"abstract":"For constraint programming, many well performing dynamic symmetry breaking techniques have been devised. For propositional satisfiability solving, dynamic symmetry breaking is still either slower or less general than static symmetry breaking. This paper presents Symmetry Propagation, which is an improvement to Lightweight Dynamic Symmetry Breaking, a dynamic symmetry breaking approach from CP. Symmetry Propagation uses any given symmetry as a propagator, and as a result is a general symmetry breaking technique. Experiments with an implementation in the SAT solver Minisat show that on many benchmarks, Symmetry Propagation outperforms the state-of-the-art static symmetry breaking method Shatter.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116349393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automatic Image Annotation Using Word Embedding Learning","authors":"Qi Chen, A. Yip, C. Tan","doi":"10.1109/ICTAI.2012.44","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.44","url":null,"abstract":"Automatically annotating words for images is a key to semantic-level image retrieval. Recently, several embedding learning based methods achieve good performance in this task which inspires this paper. Here we propose a novel word embedding model in which both images and words can be represented in the same embedding space. The embedding space is learnt in a discriminative nearest neighbor manner such that the annotation information could be propagated among neighbors. In order to accelerate model learning and testing, approximate-nearest-neighbor search is performed, and word embedding space is learnt in a stochastic manner. The experimental results demonstrate the effectiveness of the proposed method.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125987142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust Frame Registration for Multiple Camera Setups in Dynamic Scenes","authors":"Xu Zhao, Zhong Zhou, Y. Duan, Wei Wu","doi":"10.1109/ICTAI.2012.58","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.58","url":null,"abstract":"In this paper, we propose a novel method to register frames from multiple cameras into a consistent global scale. Assuming a moving object is observed in multiple camera setups, we use initial frames to create a global reference structure where the pose variation of each new frame is estimated using a RANSAC-based registration algorithm. We further combine the registration method with other state-of the-art techniques to build a high quality 3D reconstruction system with a smaller number of cameras than used by more traditional methods. Experimental results show that our method performs better and is more economical than the registration of separate monocular structures from motion methods. 3D reconstruction results on various challenging real world multi-camera video datasets also illustrate the feasibility and robustness of our method.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}