Victor Lesser
Research Subjects
Research Interests
Victor Lesser has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Anita Raja
University of North Carolina, Charlotte
5 shared publications - Bryan Horling
University of Massachusetts
5 shared publications - Thomas A. Wagner
Defense Advanced Research Projects Agency
3 shared publications - Xiaoqin Zhang
University of Massachusetts at Dartmouth
3 shared publications - Bo An
University of Massachusetts
2 shared publications - Keith Decker
Department of Computer and Information Sciences, College of Engineering, University of Delaware, Newark, DE, United States
2 shared publications
Latest Publications
- Open Access
Context-Based Concurrent Experience Sharing in Multiagent Systems
One of the key challenges for multi-agent learning is scalability. In this paper, we introduce a technique for speeding up multi-agent learning by exploiting concurrent and incremental experience sharing. This solution adaptively identifies opportunities to transfer experiences between agents and allows for the rapid acquisition of appropriate policies in large-scale, stochastic, homogeneous multi-agent systems. We introduce an online, distributed, supervisor-directed transfer technique for constructing high-level characterizations of an agent's dynamic learning environment---called contexts---which are used to identify groups of agents operating under approximately similar dynamics within a short temporal window. A set of supervisory agents computes contextual information for groups of subordinate agents, thereby identifying candidates for experience sharing. Our method uses a tiered architecture to propagate, with low communication overhead, state, action, and reward data amongst the members of each dynamically-identified information-sharing group. We applied this method to a large-scale distributed task allocation problem with hundreds of information-sharing agents operating in an unknown, non-stationary environment. We demonstrate that our approach results in significant performance gains, that it is robust to noise-corrupted or suboptimal context features, and that communication costs scale linearly with the supervisor-to-subordinate ratio.
Open AccessContext-Based Concurrent Experience Sharing in Multiagent Systems
One of the key challenges for multi-agent learning is scalability. In this paper, we introduce a technique for speeding up multi-agent learning by exploiting concurrent and incremental experience sharing. This solution adaptively identifies opportunities to transfer experiences between agents and allows for the rapid acquisition of appropriate policies in large-scale, stochastic, homogeneous multi-agent systems. We introduce an online, distributed, supervisor-directed transfer technique for constructing high-level characterizations of an agent's dynamic learning environment---called contexts---which are used to identify groups of agents operating under approximately similar dynamics within a short temporal window. A set of supervisory agents computes contextual information for groups of subordinate agents, thereby identifying candidates for experience sharing. Our method uses a tiered architecture to propagate, with low communication overhead, state, action, and reward data amongst the members of each dynamically-identified information-sharing group. We applied this method to a large-scale distributed task allocation problem with hundreds of information-sharing agents operating in an unknown, non-stationary environment. We demonstrate that our approach results in significant performance gains, that it is robust to noise-corrupted or suboptimal context features, and that communication costs scale linearly with the supervisor-to-subordinate ratio.
- 19 April 2016
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 77 (1-2) , 67-103
Alternating-offers bargaining in one-to-many and many-to-many settings
- 19 April 2016
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 77 (1-2) , 67-103
Alternating-offers bargaining in one-to-many and many-to-many settings
- 1 January 2013
- Published by IOS Press in Web Intelligence and Agent Systems: An International Journal
- Vol. 11 (1) , 81-105
Multiagent meta-level control for radar coordination
It is crucial for embedded systems to adapt to the dynamics of open environments. This adaptation process becomes especially challenging in the context of multiagent systems. In this paper, we argue that multiagent meta-level control is an effective
- 1 January 2013
- Published by IOS Press in Web Intelligence and Agent Systems: An International Journal
- Vol. 11 (1) , 81-105
Multiagent meta-level control for radar coordination
It is crucial for embedded systems to adapt to the dynamics of open environments. This adaptation process becomes especially challenging in the context of multiagent systems. In this paper, we argue that multiagent meta-level control is an effective
- Open Access
- 24 May 2012
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 26 (3) , 420-455
Bilateral bargaining with one-sided uncertain reserve prices
- 24 May 2012
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 26 (3) , 420-455
Open AccessBilateral bargaining with one-sided uncertain reserve prices
- 15 March 2012
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 22 (4) , 681-713
Meta-level Coordination for Solving Distributed Negotiation Chains in Semi-cooperative Multi-agent Systems
- 15 March 2012
- Published by Springer Nature in Group Decision and Negotiation
- Vol. 22 (4) , 681-713
Meta-level Coordination for Solving Distributed Negotiation Chains in Semi-cooperative Multi-agent Systems
- Open Access
Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions
To deal with the prohibitive complexity of calculating policies in Decentralized MDPs, researchers have proposed models that exploit structured agent interactions. Settings where most agent actions are independent except for few actions that affect the transitions and/or rewards of other agents can be modeled using Event-Driven Interactions with Complex Rewards (EDI-CR). Finding the optimal joint policy can be formulated as an optimization problem. However, existing formulations are too verbose and/or lack optimality guarantees. We propose a compact Mixed Integer Linear Program formulation of EDI-CR instances. The key insight is that most action sequences of a group of agents have the same effect on a given agent. This allows us to treat these sequences similarly and use fewer variables. Experiments show that our formulation is more compact and leads to faster solution times and better solutions than existing formulations.
Open AccessCompact Mathematical Programs For DEC-MDPs With Structured Agent Interactions
To deal with the prohibitive complexity of calculating policies in Decentralized MDPs, researchers have proposed models that exploit structured agent interactions. Settings where most agent actions are independent except for few actions that affect the transitions and/or rewards of other agents can be modeled using Event-Driven Interactions with Complex Rewards (EDI-CR). Finding the optimal joint policy can be formulated as an optimization problem. However, existing formulations are too verbose and/or lack optimality guarantees. We propose a compact Mixed Integer Linear Program formulation of EDI-CR instances. The key insight is that most action sequences of a group of agents have the same effect on a given agent. This allows us to treat these sequences similarly and use fewer variables. Experiments show that our formulation is more compact and leads to faster solution times and better solutions than existing formulations.
- 4 November 2011
- Published by Springer Nature
- p. 145-149
Yushu: A Heuristic-Based Agent for Automated Negotiating Competition
- 4 November 2011
- Published by Springer Nature
- p. 145-149
Yushu: A Heuristic-Based Agent for Automated Negotiating Competition
- Open Access
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint satisfaction and these problems often present themselves in a distributed form. In this article, we present a new complete, distributed algorithm called Asynchronous Partial Overlay (APO) for solving DCSPs that is based on a cooperative mediation process. The primary ideas behind this algorithm are that agents, when acting as a mediator, centralize small, relevant portions of the DCSP, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO outperforms other known, complete DCSP techniques.
Open AccessAsynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represented as constraint satisfaction and these problems often present themselves in a distributed form. In this article, we present a new complete, distributed algorithm called Asynchronous Partial Overlay (APO) for solving DCSPs that is based on a cooperative mediation process. The primary ideas behind this algorithm are that agents, when acting as a mediator, centralize small, relevant portions of the DCSP, that these centralized subproblems overlap, and that agents increase the size of their subproblems along critical paths within the DCSP as the problem solving unfolds. We present empirical evidence that shows that APO outperforms other known, complete DCSP techniques.
- 20 May 2010
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 23 (1) , 114-153
Strategic agents for multi-resource negotiation
- 20 May 2010
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 23 (1) , 114-153
Strategic agents for multi-resource negotiation
- 15 December 2007
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 16 (2) , 151-185
Automated organization design for multi-agent systems
- 15 December 2007
- Published by Springer Nature in Autonomous Agents and Multi-Agent Systems
- Vol. 16 (2) , 151-185
Automated organization design for multi-agent systems