Imperial College London

Professor Nick Jennings

Central FacultyOffice of the Provost

Vice-Provost (Research and Enterprise)
 
 
 
//

Contact

 

+44 (0)20 7594 8458n.jennings Website CV

 
 
//

Assistant

 

Ms Emma Neave +44 (0)20 7594 8458

 
//

Location

 

Room 4.10Faculty BuildingSouth Kensington Campus

//

Summary

 

Publications

Publication Type
Year
to

642 results found

Alkayal ES, Jennings NR, Abulkhair MF, 2017, Efficient Task Scheduling Multi-Objective Particle Swarm Optimization in Cloud Computing, Pages: 17-24

© 2016 IEEE. Task scheduling in data centers is a complex task due to their evolution in size, complexity, and performance. At the same time, customers' requirements have become more sophisticated in terms of execution time and throughput. Against this background, this work presents a new model of resource allocation that optimizes task scheduling using a multi-objective optimization (MOO) and particle swarm optimization (PSO) algorithm. In more detail, we develop a novel multi-objective PSO (MOPSO) algorithm, based on a new ranking strategy. The main insight of this algorithm is that the tasks are scheduled to the virtual machines to minimize waiting time and maximize system throughput. The algorithm leads to a reduction in execution time of 20%, a reduction the waiting time of 30%, and shows improvements of up to 40% in throughput compared to the current state of the art.

CONFERENCE PAPER

Augustin A, Venanzi M, Rogers A, Jennings NRet al., 2017, Bayesian aggregation of categorical distributions with applications in crowdsourcing, Pages: 1411-1417, ISSN: 1045-0823

A key problem in crowdsourcing is the aggregation of judgments of proportions. For example, workers might be presented with a news article or an image, and be asked to identify the proportion of each topic, sentiment, object, or colour present in it. These varying judgments then need to be aggregated to form a consensus view of the document's or image's contents. Often, however, these judgments are skewed by workers who provide judgments randomly. Such spammers make the cost of acquiring judgments more expensive and degrade the accuracy of the aggregation. For such cases, we provide a new Bayesian framework for aggregating these responses (expressed in the form of categorical distributions) that for the first time accounts for spammers. We elicit 796 judgments about proportions of objects and colours in images. Experimental results show comparable aggregation accuracy when 60% of the workers are spammers, as other state of the art approaches do when there are no spammers.

CONFERENCE PAPER

Meir R, Polukarov M, Rosenschein JS, Jennings NRet al., 2017, Iterative voting and acyclic games, Artificial Intelligence, Vol: 252, Pages: 100-122, ISSN: 0004-3702

© 2017 Elsevier B.V. Multi-agent decision problems, in which independent agents have to agree on a joint plan of action or allocation of resources, are central to artificial intelligence. In such situations, agents' individual preferences over available alternatives may vary, and may try to reconcile these differences by voting. We consider scenarios where voters cannot coordinate their actions, but are allowed to change their vote after observing the current outcome, as is often the case both in offline committees and in online voting. Specifically, we are interested in identifying conditions under which such iterative vo ting processes are guaranteed to converge to a Nash equilibrium state—that is, under which this process is acyclic. We classify convergence results based on the underlying assumptions about the agent scheduler (the order in which the agents take their actions) and the action scheduler (the actions available to the agents at each step). By so doing, we position iterative voting models within the general framework of acyclic games and game forms. In more detail, our main technical results provide a complete picture of conditions for acyclicity in several variations of Plurality voting. In particular, we show that (a) under the traditional lexicographic tie-breaking, the game converges from any state and for any order of agents, under a weak restriction on voters' actions; and that (b) Plurality with randomized tie-breaking is not guaranteed to converge under arbitrary agent schedulers, but there is always some path of better replies from any initial state of the game to a Nash equilibrium. We thus show a first separation between order-free acyclicity and weak acyclicity of game forms, thereby settling an open question from [7]. In addition, we refute another conjecture of Kukushkin regarding strongly acyclic voting rules, by proving the existence of strongly acyclic separable game forms.

JOURNAL ARTICLE

Panagopoulos AA, Maleki S, Rogers A, Venanzi M, Jennings NRet al., 2017, Advanced economic control of electricity-based space heating systems in domestic coalitions with shared intermittent energy resources, ACM Transactions on Intelligent Systems and Technology, Vol: 8, ISSN: 2157-6904

© 2017 ACM. Over the past few years, Domestic Heating Automation Systems (DHASs) that optimize the domestic space heating control process with minimum user input, utilizing appropriate occupancy prediction technology, have emerged as commercial products (e.g., the smart thermostats from Nest and Honeywell). At the same time, many houses are being equipped with, potentially grid-connected, Intermittent Energy Resources (IERs), such as rooftop photovoltaic systems and/or small wind turbine generators. Now, in many regions of the world, such houses can sell energy to the grid but at a lower price than the price of bu ying it. In this context, and given the anticipated increase in electrification of heating, the next generation DHASs need to incorporate Advanced Economic Control (AEC). Such AEC can exploit the energy buffer that heating loads provide, in order to shift the consumption of electricity-based heating systems to follow the intermittent energy generation of the house. By so doing, the energy imported from the grid can be minimized and considerable monetary gains for the household can be achieved, without affecting the occupants' schedule. These benefits can be amplified still further in domestic coalitions, where a number of houses come together and share their IER generation to minimize their cumulative grid energy import. Given the above, in this work we extend a state-of-The-Art DHAS, to propose AdaHeat+, a practical DHAS, that, for the first time, incorporates AEC. Our work is applicable to both individual houses and domestic coalitions and comes complete with an allocation mechanism to share the coalition gains. Importantly, we propose an effective heuristic heating schedule planning approach for collective AEC that (i) has a complexity that scales in a linear and parallelizable manner with the coalition size, and (ii) enables AdaHeat+ to handle the distinct preferences, in balancing heating cost and thermal discomfort, of the households. Our approa

JOURNAL ARTICLE

Pruna RT, Polukarov M, Jennings NR, 2017, Avoiding regret in an agent-based asset pricing model, Finance Research Letters, ISSN: 1544-6123

© 2017. We use an agent-based asset pricing model to test the implications of the disposition effect (avoiding regret) on investors' interactions and price settings. We show that it has a direct impact on the returns series produced by the model, altering important stylized facts such as its heavy tails and volatility clustering. Moreover, we show that the horizon over which investors compute their wealth has no effect on the dynamics produced by the model.

JOURNAL ARTICLE

Robu V, Vinyals M, Rogers A, Jennings Net al., 2017, Efficient Buyer Groups with Prediction-of-Use Electricity Tariffs, IEEE Transactions on Smart Grid, Pages: 1-1, ISSN: 1949-3053

JOURNAL ARTICLE

Stein S, Eshghi S, Maghsudi S, Tassiulas L, Bellamy RKE, Jennings NRet al., 2017, Heuristic algorithms for influence maximization in partially observable social networks, Pages: 20-32, ISSN: 1613-0073

Copyright © 2017 for the individual papers by the papers' authors. We consider the problem of selecting the most influential members within a social network, in order to disseminate a message as widely as possible. This problem, also referred to as seed selection for influence maximization, has been under intensive investigation since the emergence of social networks. Nonetheless, a large body of existing research is based on the assumption that the network is completely known, whereas little work considers partially observable networks. Yet, due to many issues including the extremely large size of current networks and privacy considerations, assuming full knowledge of the network is rather unrealistic. Despite this, an influencer often wishes to distribute its message far beyond the boundaries of the known network. In this preliminary study, we propose a set of novel heuristic algorithms that specifically target nodes at this boundary, in order to maximize influence across the whole network. We show that these algorithms outperform the state of the art by up to 38% in networks with partial observability.

CONFERENCE PAPER

Stein S, Gerding EH, Nedea A, Rosenfeld A, Jennings NRet al., 2017, Market Interfaces for Electric Vehicle Charging, JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, Vol: 59, Pages: 175-227, ISSN: 1076-9757

JOURNAL ARTICLE

Stein S, Gerding EH, Nedea A, Rosenfeld A, Jennings NRet al., 2017, Evaluating market user interfaces for electric vehicle charging using Bid2Charge, Pages: 4939-4943, ISSN: 1045-0823

We consider settings where electric vehicle drivers participate in a market mechanism to charge their vehicles. Existing work typically assumes that participants are fully rational and can report their charging preferences accurately. However, this may not be reasonable in settings with non-experts. To explore this, we design a novel game called Bid2Charge and compare a fully expressive interface that covers the entire space of preferences to two restricted interfaces that offer fewer possible reports. We show that restricting the users' preferences significantly reduces deliberation times while also leading to an increase in utility by up to 70%.

CONFERENCE PAPER

Waniek M, Tran-Thanh L, Michalak TP, Jennings NRet al., 2017, The dollar auction with spiteful players, Pages: 736-742

Copyright © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. The dollar auction is an auction model used to analyse the dynamics of conflict escalation. In this paper, we analyse the course of an auction when participating players are spiteful, i.e., they are motivated not only by their own profit, but also by the desire to hurt the opponent. We investigate this model for the complete information setting, both for the standard scenario and for the situation where auction starts with nonzero bids. Our results give us insight into the possible effects of meanness onto conflict escalation.

CONFERENCE PAPER

Zhang Y, An B, Tran-Thanh L, Wang Z, Gan J, Jennings NRet al., 2017, Optimal escape interdiction on transportation networks, Pages: 3936-3944, ISSN: 1045-0823

Preventing crimes or terrorist attacks in urban areas is challenging. Law enforcement officers need to respond quickly to catch the attacker on his escape route, which is subject to time-dependent traffic conditions on transportation networks. The attacker can strategically choose his escape path and driving speed to avoid being captured. Existing work on security resource allocation has not considered such scenarios with time-dependent strategies for both players. Therefore, in this paper, we study the problem of efficiently scheduling security resources for interdicting the escaping attacker. We propose: 1) a new defender-attacker security game model for escape interdiction on transportation networks; and 2) an efficient double oracle algorithm to compute the optimal defender strategy, which combines mixed-integer linear programming formulations for best response problems and effective approximation algorithms for improving the scalability of the algorithms. Experimental evaluation shows that our approach significantly outperforms baselines in solution quality and scales up to realistic-sized transportation networks with hundreds of intersections.

CONFERENCE PAPER

Alan AT, Costanza E, Ramchurn SD, Fischer J, Rodden T, Jennings NRet al., 2016, Tariff Agent: Interacting with a Future Smart Energy System at Home, ACM TRANSACTIONS ON COMPUTER-HUMAN INTERACTION, Vol: 23, ISSN: 1073-0516

JOURNAL ARTICLE

Alkayal ES, Jennings NR, Abulkhair MF, 2016, Efficient Task Scheduling Multi-Objective Particle Swarm Optimization in Cloud Computing, 41st IEEE Conference on Local Computer Networks (LCN), Publisher: IEEE, Pages: 17-24

CONFERENCE PAPER

Baker CAB, Ramchurn S, Teacy WTL, Jennings NRet al., 2016, Planning Search and Rescue Missions for UAV Teams, 22nd European Conference on Artificial Intelligence (ECAI), Publisher: IOS PRESS, Pages: 1777-1782, ISSN: 0922-6389

CONFERENCE PAPER

Beck Z, Teacy L, Rogers A, Jennings NRet al., 2016, Online planning for collaborative search and rescue by heterogeneous robot teams, Pages: 1024-1032, ISSN: 1548-8403

Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. Collaboration is essential for effective performance by groups of robots in disaster response settings. Here we are particularly interested in heterogeneous robots that collaborate in complex scenarios with incomplete, dynamically changing information. In detail, we consider a search and rescue setting, where robots with different capabilities work together to accomplish tasks (rescue) and find information about further tasks (search) at the same time. The state of the art for such collaboration is robot control based on independent planning for robots with different capabilities and typically incorporates uncertainty with only a limited scope. In contrast, in this paper, we create a joint plan to optimise all robots' actions incorporating uncertainty about the future information gain of the robots. We evaluate our planner's performance in settings based on real disasters and find that our approach decreases the response time by 20-25% compared to state-of-the-art approaches. In addition, practical constraints are met in terms of time and resource utilisation.

CONFERENCE PAPER

Michalak T, Rahwan T, Elkind E, Wooldridge M, Jennings NRet al., 2016, A hybrid exact algorithm for complete set partitioning, ARTIFICIAL INTELLIGENCE, Vol: 230, Pages: 14-50, ISSN: 0004-3702

JOURNAL ARTICLE

Obraztsova S, Rabinovich Z, Elkind E, Polukarov M, Jennings NRet al., 2016, Trembling hand equilibria of plurality voting, Pages: 440-446, ISSN: 1045-0823

Trembling hand (TH) equilibria were introduced by Selten in 1975. Intuitively, these are Nash equilibria that remain stable when players assume that there is a small probability that other players will choose off-equilibrium strategies. This concept is useful for equilibrium refinement, i.e., selecting the most plausible Nash equilibria when the set of all Nash equilibria can be very large, as is the case, for instance, for Plurality voting with strategic voters. In this paper, we analyze TH equilibria of Plurality voting. We provide an efficient algorithm for computing a TH best response and establish many useful properties of TH equilibria in Plurality voting games. On the negative side, we provide an example of a Plurality voting game with no TH equilibria, and show that it is NP-hard to check whether a given Plurality voting game admits a TH equilibrium where a specific candidate is among the election winners.

CONFERENCE PAPER

Powell R, An B, Jennings NR, Long T-Tet al., 2016, On the Vulnerability of Outlier Detection Algorithms in Smart Traffic Control Systems, 7th International Conference on Decision and Game Theory for Security (GameSec), Publisher: SPRINGER INT PUBLISHING AG, Pages: 474-475, ISSN: 0302-9743

CONFERENCE PAPER

Pruna RT, Polukarov M, Jennings NR, 2016, An Asset Pricing Model with Loss Aversion and its Stylized Facts, IEEE Symposium Series on Computational Intelligence (IEEE SSCI), Publisher: IEEE

CONFERENCE PAPER

Ramchurn SD, Trung DH, Wu F, Ikuno Y, Flann J, Moreau L, Fischer JE, Jiang W, Rodden T, Simpson E, Reece S, Roberts S, Jennings NRet al., 2016, A Disaster Response System based on Human-Agent Collectives, JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, Vol: 57, Pages: 661-708, ISSN: 1076-9757

JOURNAL ARTICLE

Ramchurn SD, Wu F, Jiang W, Fischer JE, Reece S, Roberts S, Rodden T, Greenhalgh C, Jennings NRet al., 2016, Human-agent collaboration for disaster response, AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, Vol: 30, Pages: 82-111, ISSN: 1387-2532

JOURNAL ARTICLE

Robu V, Chalkiadakis G, Kota R, Rogers A, Jennings NRet al., 2016, Rewarding cooperative virtual power plant formation using scoring rules, ENERGY, Vol: 117, Pages: 19-28, ISSN: 0360-5442

JOURNAL ARTICLE

Shi B, Gerding EH, Jennings NR, 2016, An equilibrium analysis of trading across multiple double auction marketplaces using fictitious play, ELECTRONIC COMMERCE RESEARCH AND APPLICATIONS, Vol: 17, Pages: 134-149, ISSN: 1567-4223

JOURNAL ARTICLE

Stein S, Gerding EH, Nedea A, Rosenfeld A, Jennings NRet al., 2016, Bid2Charge: Market user interface design for electric vehicle charging, Pages: 882-890, ISSN: 1548-8403

Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. We consider settings where owners of electric vehicles (EVs) participate in a market mechanism to charge their vehicles. Existing work on such mechanisms has typically assumed that participants are fully rational and can report their preferences accurately to the mechanism or to a software agent participating on their behalf. However, this may not be reasonable in settings with non-expert human end-users. To explore this, we compare a fully expressive interface that covers the entire space of preferences to two restricted interfaces that reduce the space of possible options. To enable this analysis, we develop a novel game that replicates key features of an abstract EV charging scenario. In two extensive evaluations with over 300 users, we show that restricting the users' preferences significantly reduces the time they spend deliberating. More surprisingly, it also leads to an increase in their utility compared to the fully expressive interface (up to 70%). Finally, we find that a reinforcement learning agent displays similar performance trends, enabling a novel methodology for evaluating market interfaces.

CONFERENCE PAPER

Venanzi M, Guiver J, Kohli P, Jennings NRet al., 2016, Time-Sensitive Bayesian Information Aggregation for Crowdsourcing Systems, JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, Vol: 56, Pages: 517-545, ISSN: 1076-9757

JOURNAL ARTICLE

Xu H, Tran-Thanh L, Jennings NR, 2016, Playing repeated security games with no prior knowledge, Pages: 104-112, ISSN: 1548-8403

Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. This paper investigates repeated security games with unknown (to the defender) game payoffs and attacker behaviors. As existing work assumes prior knowledge about either the game payoffs or the attacker's behaviors, they are not suitable for tackling our problem. Given this, we propose the first efficient defender strategy, based on an adversarial online learning framework, that can provably achieve good performance guarantees without any prior knowledge. In particular, we prove that our algorithm can achieve low performance loss against the best fixed strategy on hindsight (i.e., having full knowledge of the attacker's moves). In addition, we prove that our algorithm can achieve an efficient competitive ratio against the optimal adaptive defender strategy. We also show that for zero-sum security games, our algorithm achieves efficient results in approximating a number of solution concepts, such as algorithmic equilibria and the minimax value. Finally, our extensive numerical results demonstrate that, without having any prior information, our algorithm still achieves good performance, compared to state-of-the-art algorithms from the literature on security games, such as SUQR [19], which require significant amount of prior knowledge.

CONFERENCE PAPER

Zenonos A, Stein S, Jennings NR, 2016, An algorithm to coordinate measurements using stochastic human mobility patterns in large-scale participatory sensing settings, Pages: 3936-3942

© 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Participatory sensing is a promising new low-cost approach for collecting environmental data. However, current large-scale environmental participatory sensing campaigns typically do not coordinate the measurements of participants, which can lead to gaps or redundancy in the collected data. While some work has considered this problem, it has made several unrealistic assumptions. In particular, it assumes that complete and accurate knowledge about the participants future movements is available and it does not consider constraints on the number of measurements a user is willing to take. To address these shortcomings, we develop a computationally-efficient coordination algorithm (Bestmatch) to suggest to users where and when to take measurements. Our algorithm exploits human mobility patterns, but explicitly considers the inherent uncertainty of these patterns.We empirically evaluate our algorithm on a real-world human mobility and air quality dataset and show that it outperforms the state-of-the-art greedy and pull-based proximity algorithms in dynamic environments.

CONFERENCE PAPER

Zhao D, Ramchurn SD, Jennings NR, 2016, Fault tolerant mechanism design for general task allocation, Pages: 323-331, ISSN: 1548-8403

Copyright © 2016, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. We study a general task allocation problem, involving multiple agents that collaboratively accomplish tasks and where agents may fail to successfully complete the tasks assigned to them (known as execution uncertainty). The goal is to choose an allocation that maximises social welfare while taking their execution uncertainty into account (i.e., fault tolerant). To achieve this, we show that the post-execution verification (PEV)-based mechanism presented by Porter et al. (2008) is applicable if and only if agents' valuations are risk-neutral (i.e., the solution is almost universal). We then consider a more advanced setting where an agent's execution uncertainty is not completely predictable by the agent alone but aggregated from all agents' private opinions (known as trust). We show that PEV-based mechanism with trust is still applicable if and only if the trust aggregation is multilinear. Given this characterisation, we further demonstrate how this mechanism can be successfully applied in a real-world setting. Finally, we draw the parallels between our results and the literature of efficient mechanism design with general interdependent valuations.

CONFERENCE PAPER

Alan AT, Costanza E, Ramchurn S, Fischer J, Rodden T, Jennings NRet al., 2015, Managing energy tariffs with agents: a field study of a future smart energy system at home, Adjunct Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing and Proceedings of the 2015 ACM International Symposium on Wearable Computers

CONFERENCE PAPER

Ghosh S, Reece S, Rogers A, Roberts S, Malibari A, Jennings NRet al., 2015, Modeling the Thermal Dynamics of Buildings: A Latent-Force-Model-Based Approach, ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, Vol: 6, ISSN: 2157-6904

JOURNAL ARTICLE

This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.

Request URL: http://wlsprd.imperial.ac.uk:80/respub/WEB-INF/jsp/search-html.jsp Request URI: /respub/WEB-INF/jsp/search-html.jsp Query String: respub-action=search.html&id=00341208&limit=30&person=true