Rensselaer Polytechnic Institute
Approximate Equilibrium and Incentivizing Social Coordination
Anshelevich, Elliot (Rensselaer Polytechnic Institute) | Sekar, Shreyas (Rensselaer Polytechnic Institute)
We study techniques to incentivize self-interested agents to form socially desirable solutions in scenarios where they benefit from mutual coordination. Towards this end, we consider coordination games where agents have different intrinsic preferences but they stand to gain if others choose the same strategy as them. For non-trivial versions of our game, stable solutions like Nash Equilibrium may not exist, or may be socially inefficient even when they do exist. This motivates us to focus on designing efficient algorithms to compute (almost) stable solutions like Approximate Equilibrium that can be realized if agents are provided some additional incentives. Our results apply in many settings like adoption of new products, project selection, and group formation, where a central authority can direct agents towards a strategy but agents may defect if they have better alternatives. We show that for any given instance, we can either compute a high quality approximate equilibrium or a near-optimal solution that can be stabilized by providing small payments to some players. Our results imply that a little influence is necessary in order to ensure that selfish players coordinate and form socially efficient solutions.
Semantic Data Representation for Improving Tensor Factorization
Nakatsuji, Makoto (NTT Corporation) | Fujiwara, Yasuhiro (NTT Corporation) | Toda, Hiroyuki (NTT Corporation) | Sawada, Hiroshi (NTT Corporation) | Zheng, Jin (Rensselaer Polytechnic Institute) | Hendler, James Alexander (Rensselaer Polytechnic Institute)
Predicting human activities is important for improving recommender systems or analyzing social relationships among users. Those human activities are usually repre- sented as multi-object relationships (e.g. userโs tagging activities for items or userโs tweeting activities at some locations). Since multi-object relationships are naturally represented as a tensor, tensor factorization is becom- ing more important for predicting usersโ possible ac- tivities. However, its prediction accuracy is weak for ambiguous and/or sparsely observed objects. Our so- lution, Semantic data Representation for Tensor Fac- torization (SRTF), tackles these problems by incorpo- rating semantics into tensor factorization based on the following ideas: (1) It first links objects to vocabu- laries/taxonomies and resolves the ambiguity caused by objects that can be used for multiple purposes. (2) It next links objects to composite classes that merge classes in different kinds of vocabularies/taxonomies (e.g. classes in vocabularies for movie genres and those for directors) to avoid low prediction accuracy caused by rough-grained semantics. (3) It then lifts sparsely observed objects into their classes to solve the sparsity problem for rarely observed objects. To the best of our knowledge, this is the first study that leverages seman- tics to inject expert knowledge into tensor factorization. Experiments show that SRTF achieves up to 10% higher accuracy than state-of-the-art methods.
Reports on the 2013 AAAI Fall Symposium Series
Burns, Gully (Information Sciences Institute, University of Southern California) | Gil, Yolanda (Information Sciences Institute and Department of Computer Science, University of Southern California) | Liu, Yan (University of Southern California) | Villanueva-Rosales, Natalia (University of Texas at El Paso) | Risi, Sebastian (University of Copenhagen) | Lehman, Joel (University of Texas at Austin) | Clune, Jeff (University of Wyoming) | Lebiere, Christian (Carnegie Mellon University) | Rosenbloom, Paul S. (University of Southern California) | Harmelen, Frank van (Vrije Universiteit Amsterdam) | Hendler, James A. (Rensselaer Polytechnic Institute) | Hitzler, Pascal (Wright State University) | Janowic, Krzysztof (University of California, Santa Barbara) | Swarup, Samarth (Virginia Polytechnic Institute and State University)
The Association for the Advancement of Artificial Intelligence was pleased to present the 2013 Fall Symposium Series, held Friday through Sunday, November 15โ17, at the Westin Arlington Gateway in Arlington, Virginia near Washington DC USA. The titles of the five symposia were as follows: Discovery Informatics: AI Takes a Science-Centered View on Big Data (FS-13-01); How Should Intelligence be Abstracted in AI Research: MDPs, Symbolic Representations, Artificial Neural Networks, or --? The highlights of each symposium are presented in this report.
Workshops Held at the Ninth Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE): A Report
Liapis, Antonios (Technical University of Copenhagen) | Cook, Michael (Goldsmiths College London) | Smith, Adam M. (University of Washington) | Smith, Gillian (Northeastern University) | Zook, Alexander (Georgia Institute of Technology) | Si, Mei (Rensselaer Polytechnic Institute) | Cavazza, Marc (Teesside University) | Pasquier, Philippe (Simon Fraser University)
The Ninth Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE) was held October 14โ18, 2013, at Northeastern University in Boston, Massachusetts. Workshops were held on the two days prior to the start of the main conference, giving attendees a chance to hold in-depth discussions on topics that complement the themes of the main conference program. This year the workshops included the First Workshop on AI and Game Aesthetics (1 day), The Second Workshop on AI in the Game Design Process (1 day), The Second International Workshop on Musical Metacreation (2 day), The Sixth Workshop on Intelligent Narrative Technologies (2 day).
Workshops Held at the Ninth Annual AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE): A Report
Liapis, Antonios (Technical University of Copenhagen) | Cook, Michael (Goldsmiths College London) | Smith, Adam M. (University of Washington) | Smith, Gillian (Northeastern University) | Zook, Alexander (Georgia Institute of Technology) | Si, Mei (Rensselaer Polytechnic Institute) | Cavazza, Marc (Teesside University) | Pasquier, Philippe (Simon Fraser University)
The workshop was accompanied by an evening Games are unique in that their components event, DAGGER, which drew together local game developers (from the rules and goals of the game to the appearance and academic research projects. Acting both of avatars and their dialogue) must encompass as an exhibition and as an informal gathering, the both functional and aesthetic prerequisites. Artificial DAGGER event allowed attendees to interact directly intelligence usually focuses on the functional quality with a wide variety of game types and technologies, of such game components, for example, ensuring as well as with their developers. As events such that an avatar can traverse a level in minimal time or as DAGGER help bridge the gap between theoretical that AI can win over any human in a strategy game. The papers avatar, or level would appeal to a particular player. of the workshop were published as AAAI Technical The Workshop on AI and Game Aesthetics provided Report WS-13-19.
Reports on the 2013 AAAI Fall Symposium Series
Burns, Gully (Information Sciences Institute, University of Southern California) | Gil, Yolanda (Information Sciences Institute and Department of Computer Science, University of Southern California) | Liu, Yan (University of Southern California) | Villanueva-Rosales, Natalia (University of Texas at El Paso) | Risi, Sebastian (University of Copenhagen) | Lehman, Joel (University of Texas at Austin) | Clune, Jeff (University of Wyoming) | Lebiere, Christian (Carnegie Mellon University) | Rosenbloom, Paul S. (University of Southern California) | Harmelen, Frank van (Vrije Universiteit Amsterdam) | Hendler, James A. (Rensselaer Polytechnic Institute) | Hitzler, Pascal (Wright State University) | Janowic, Krzysztof (University of California, Santa Barbara) | Swarup, Samarth (Virginia Polytechnic Institute and State University)
Rinke Hoekstra (VU University from transferring and adapting semantic web Amsterdam) presented linked open data tools technologies to the big data quest. Finally, in the Social to discover connections within established scientific Networks and Social Contagion symposium, a data sets. Louiqa Rashid (University of Maryland) community of researchers explored topics such as social presented work on similarity metrics linking together contagion, game theory, network modeling, network-based drugs, genes, and diseases. Kyle Ambert (Intel) presented inference, human data elicitation, and Finna, a text-mining system to identify passages web analytics. Highlights of the symposia are contained of interest containing descriptions of neuronal in this report.
On the Social Welfare of Mechanisms for Repeated Batch Matching
Anshelevich, Elliot (Rensselaer Polytechnic Institute) | Chhabra, Meenal (Virginia Tech) | Das, Sanmay (Virginia Tech) | Gerrior, Matthew (GreaneTree Technology)
We study hybrid online-batch matching problems, where agents arrive continuously, but are only matched in periodic rounds, when many of them can be considered simultaneously. Agents not getting matched in a given round remain in the market for the next round. This setting models several scenarios of interest, including many job markets as well as kidney exchange mechanisms. We consider the social utility of two commonly used mechanisms for such markets: one that aims for stability in each round (greedy), and one that attempts to maximize social utility in each round (max-weight). Surprisingly, we find that in the long term, the social utility of the greedy mechanism can be higher than that of the max-weight mechanism. We hypothesize that this is because the greedy mechanism behaves similarly to a soft threshold mechanism, where all connections below a certain threshold are rejected by the participants in favor of waiting until the next round. Motivated by this observation, we propose a method to approximately calculate the optimal threshold for an individual agent to use based on characteristics of the other agents participating, and demonstrate experimentally that social utility is high when all agents use this strategy. Thresholding can also be applied by the mechanism itself to improve social welfare; we demonstrate this with an example on graphs that model pairwise kidney exchange.
Instructor Rating Markets
Chakraborty, Mithun (Virginia Tech) | Das, Sanmay (Virginia Tech) | Lavoie, Allen (Virginia Tech) | Magdon-Ismail, Malik (Rensselaer Polytechnic Institute) | Naamad, Yonatan (Princeton University)
We describe the design of Instructor Rating Markets (IRMs) where human participants interact through intelligent automated market-makers in order to provide dynamic collective feedback to instructors on the progress of their classes. The markets are among the first to enable the empirical study of prediction markets where traders can affect the very outcomes they are trading on. More than 200 students across the Rensselaer campus participated in markets for ten classes in the Fall 2010 semester. In this paper, we describe how we designed these markets in order to elicit useful information, and analyze data from the deployment. We show that market prices convey useful information on future instructor ratings and contain significantly more information than do past ratings. The bulk of useful information contained in the price of a particular class is provided by students who are in that class, showing that the markets are serving to disseminate insider information. At the same time, we find little evidence of attempted manipulation by raters. The markets are also a laboratory for comparing different market designs and the resulting price dynamics, and we show how they can be used to compare market making algorithms.
David L Waltz, in Memoriam
Gabriel, Richard P. (IBM) | Finin, Tim (University of Maryland, Baltimore County) | Sun, Ron (Rensselaer Polytechnic Institute)
David L. Waltz (1943-2012), was director, Center for Computational Learning Systems In 1973, Dave Waltz with Richard P. Gabriel in tow headed Dave Waltz delivers his AAAI Presidential Address at AAAI-98 in Madison, Wisconsin. While at Illinois, Dave produced system, paving the way for an engineering-style 11 Ph.D. students and many more MS students, approach to emergent AI techniques; and even mentored junior researchers and postdocs, attracted though their first attempts to create a multidisciplinary new AI faculty, and helped create the Beckman AI degree program failed, Dave was able in Institute for Advanced Science and Technology. In 1984, Marvin Minsky asked Dave to return to During the late 1970s and early 1980s, Waltz's Thinking Machines, Inc., an MIT spinoff in Cambridge group explored new ideas in natural language processing, -- with the temptation that the atmosphere cognitive science, qualitative reasoning, would be like the early days of the AI Lab all over and parallel computation in a collaborative environment again. At the same time he took a parttime including researchers in computer science, tenured position at Brandeis. Machines and Brandeis, Dave developed the ideas He chaired and brought the influential of massively parallel AI and, with Craig Stanfill, the Theoretical Issues in Natural Language Processing memory-based reasoning approach to case-based conference to Urbana in 1978.
Towards Interest And Engagement, A Framework For Adaptive Storytelling
Garber-Barron, Michael (Rensselaer Polytechnic Institute) | Si, Mei (Rensselaer Polytechnic Institute)
A storyteller builds a narrative that captivates the audience, immersing them in the story. Storytelling is an interactive process. Though the listeners cannot affect what happens in the story, a good narrator observes the audience's responses and adjusts his/her storytelling accordingly. We present an automated storytelling agent that is aimed at achieving the same effect. While presenting a story, the user is given chances to give comments or ask questions. The agent estimates the user's preferences towards various topics from these responses and weighs the factors of novelty, current interest, and consistency for generating the next part of the narration. We describe the components of the agent, and an example of applying it for narrating a Chinese fantasy story.