Greedy algorithms are known to provide, in polynomial time, near optimal approximation guarantees for Combinatorial Auctions (CAs) with multidimensional bidders. It is known that truthful greedy-like mechanisms for CAs with multi-minded bidders do not achieve good approximation guarantees. In this work, we seek a deeper understanding of greedy mechanism design and investigate under which general assumptions, we can have efficient and truthful greedy mechanisms for CAs. Towards this goal, we use the framework of priority algorithms and weak and strong verification, where the bidders are not allowed to overbid on their winning set or on any subset of this set, respectively. We provide a complete characterization of the power of weak verification showing that it is sufficient and necessary for any greedy fixed priority algorithm to become truthful with the use of money or not, depending on the ordering of the bids. Moreover, we show that strong verification is sufficient and necessary to obtain a 2-approximate truthful mechanism with money, based on a known greedy algorithm, for the problem of submodular CAs in finite bidding domains. Our proof is based on an interesting structural analysis of the strongly connected components of the declaration graph.

Research in AI continues to make video games better. The technology informs NPCs that can move and fight more convincingly, orcs with personalities and ever-more realistic visuals. Now researchers at DeepMind have taught an AI to play a customized version of Quake III Arena like a human. The team focused on a capture the flag mode, one in which the map changes from match to match. Its AI agents had to learn general strategies to be able to adapt to each new map, something humans do easily.

Recent progress in artificial intelligence through reinforcement learning (RL) has shown great success on increasingly complex single-agent environments and two-player turn-based games. However, the real-world contains multiple agents, each learning and acting independently to cooperate and compete with other agents, and environments reflecting this degree of complexity remain an open challenge. In this work, we demonstrate for the first time that an agent can achieve human-level in a popular 3D multiplayer first-person video game, Quake III Arena Capture the Flag, using only pixels and game points as input. These results were achieved by a novel two-tier optimisation process in which a population of independent RL agents are trained concurrently from thousands of parallel matches with agents playing in teams together and against each other on randomly generated environments. Each agent in the population learns its own internal reward signal to complement the sparse delayed reward from winning, and selects actions using a novel temporally hierarchical representation that enables the agent to reason at multiple timescales. During game-play, these agents display human-like behaviours such as navigating, following, and defending based on a rich learned representation that is shown to encode high-level game knowledge. In an extensive tournament-style evaluation the trained agents exceeded the win-rate of strong human players both as teammates and opponents, and proved far stronger than existing state-of-the-art agents. These results demonstrate a significant jump in the capabilities of artificial agents, bringing us closer to the goal of human-level intelligence.

Currently, we stand on the brink of a fourth Industrial revolution. Artificial Intelligence or AI is the intelligence demonstrated by machines for performing tasks. It is a specialized section of computer science which focuses on creating intelligent machines that think, react and work like humans. Some of the activities computers with artificial intelligence are built for includes problem solving, learning, analysing, speech recognition, and much more. AI is a vast field in itself, and it encompasses a wide spectrum of technologies such as Machine Learning, Automated Intelligence System, Deep learning, Neural Network, Computational Argumentation, and Multi-agent Systems to solve problems that currently seem impossible.

The problem of planning a set of paths for the coalition of robots (agents) with different capabilities is considered in the paper. Some agents can modify the environment by destructing the obstacles thus allowing the other ones to shorten their paths to the goal. As a result the mutual solution of lower cost, e.g. time to completion, may be acquired. We suggest an original procedure to identify the obstacles for further removal that can be embedded into almost any heuristic search planner (we use Theta*) and evaluate it empirically. Results of the evaluation show that time-to-complete the mission can be decreased up to 9-12 % by utilizing the proposed technique.

The AAAI 2017 Fall Symposium Series was held Thursday through Saturday, November 9–11, at the Westin Arlington Gateway in Arlington, Virginia, adjacent to Washington, DC. The titles of the six symposia were Artificial Intelligence for Human-Robot Interaction; Cognitive Assistance in Government and Public Sector Applications; Deep Models and Artificial Intelligence for Military Applications: Potentials, Theories, Practices, Tools and Risks; Human-Agent Groups: Studies, Algorithms and Challenges; Natural Communication for Human-Robot Collaboration; and A Standard Model of the Mind. The highlights of each symposium (except the Natural Communication for Human-Robot Collaboration symposium, whose organizers did not submit a report) are presented in this report.

Goal reasoning (GR) has a bright future as a foundation for the research and development of intelligent agents. GR is the study of agents that can deliberate on and self-select their goals/objectives, which is a desirable capability for some applications of deliberative autonomy. While studied in diverse AI sub-communities for multiple applications, our group has focused on how GR can play a key role for controlling autonomous systems. Thus, its importance is rapidly growing and it merits increased attention, particularly from the perspective of research on AI safety. In this article, I introduce GR, briefly relate it to other AI topics, summarize some of our group’s work on GR foundations and emerging applications, and describe some current and future research directions.

Autonomous systems that understand natural language must reason about complex language and visual observations. Key to making progress towards such systems is the availability of benchmark datasets and tasks. We introduce the Cornell Natural Language Visual Reasoning (NLVR) corpus, which targets reasoning skills like counting, comparisons, and set theory. NLVR contains 92,244 examples of natural language statements paired with synthetic images and annotated with boolean values for the simple task of determining whether the sentence is true or false about the image. While it presents a simple task, NLVR has been developed to challenge systems with diverse linguistic phenomena and complex reasoning. Linguistic analysis confirms that NLVR presents diversity and complexity beyond what is provided by contemporary benchmarks. Empirical evaluation of several methods further demonstrates the open challenges NLVR presents.

Generating sequential decision process from huge amounts of measured process data is a future research direction for collaborative factory automation, making full use of those online or offline process data to directly design flexible make decisions policy, and evaluate performance. The key challenges for the sequential decision process is to online generate sequential decision-making policy directly, and transferring knowledge across tasks domain. Most multi-task policy generating algorithms often suffer from insufficient generating cross-task sharing structure at discrete-time nonlinear systems with applications. This paper proposes the multi-task generative adversarial nets with shared memory for cross-domain coordination control, which can generate sequential decision policy directly from raw sensory input of all of tasks, and online evaluate performance of system actions in discrete-time nonlinear systems. Experiments have been undertaken using a professional flexible manufacturing testbed deployed within a smart factory of Weichai Power in China. Results on three groups of discrete-time nonlinear control tasks show that our proposed model can availably improve the performance of task with the help of other related tasks.

Back in the 1990s we started work on pedagogical agents, a new user interface paradigm for interactive learning environments. Pedagogical agents are autonomous characters that inhabit learning environments and can engage with learners in rich, face-to-face interactions. Building on this work, in 2000 we, together with our colleague, Jeff Rickel, published an article on pedagogical agents that surveyed this new paradigm and discussed its potential. We made the case that pedagogical agents that interact with learners in natural, life-like ways can help learning environments achieve improved learning outcomes. This article has been widely cited, and was a winner of the 2017 IFAAMAS Award for Influential Papers in Autonomous Agents and Multiagent Systems (IFAAMAS, 2017). On the occasion of receiving the IFAAMAS award, and after twenty years of work on pedagogical agents, we decided to take another look at the future of the field. We’ll start by revisiting our predictions for pedagogical agents back in 2000, and examine which of those predictions panned out. Then, informed what we have learned since then, we will take another look at emerging trends and the future of pedagogical agents. Advances in natural language dialogue, affective computing, machine learning, virtual environments, and robotics are making possible even more lifelike and effective pedagogical agents, with potentially profound effects on the way people learn.