Invited Speaker: Kagan Tumer


We are excited to announce that Prof. Tumer will be giving the keynote at OPTMAS this year!

Kagan Tumer

 

Title: Multiagent Systems in Optimization: Where do agents fit and what are they trying to do?

Abstract: Multiagent approaches have successfully been applied to a multitude of difficult optimization problems ranging from resource allocation to traffic management.
In this talk, we examine two issues that cut across many approaches and domains. First, we discuss the different levels at which a multiagent approach can be inserted into an optimization problem, and show that in many cases, the most “natural” fit is not necessarily the best fit. Second, we discuss how multi-objective optimization problems can benefit from insights acquired from recent advances in multiagent systems. In both cases, our results show that multiagent systems can have tremendous impact on real world optimization problems.

Bio: Dr. Kagan Tumer is a professor of robotics and control at Oregon State University, where he leads the Adaptive Agents and Distributed Intelligence Lab. Dr. Tumer’s research interests are control and optimization in large autonomous systems with a particular emphasis on multiagent coordination. Applications of his work include coordinating multiple robots, optimizing large sensor networks, controlling unmanned  aerial vehicles, reducing traffic congestion and managing air traffic.

His work has led to over one hundred and thirty publications, including three edited books, one patent, four  paper awards (including best paper at the 2007 Conference on Autonomous Agents and Multiagent Systemsand best application paper at the 2012 Genetic and Evolutionary Computation Conference).
He is an associate editor of the Journal on Autonomous Agents and Multiagent Systems, and was the program co-chair of the 2011 Autonomous Agents and Multiagent Systems Conference (AAMAS 2011). Dr. Tumer received his PhD (1996) in Electrical and  Computer Engineering at The University of Texas, Austin.

Advertisements

Final Schedule for OPTMAS

The final schedule for the workshop is now live – see below.
9:00 – 10:30

  • Trung Thanh Nguyen and Jörg Rothe. Envy-Ratio and Average-Nash Social Welfare Optimization in Multiagent Resource Allocation
  • Eric Shieh, Manish Jain, Albert Jiang and Milind Tambe. Efficiently Solving Time-Dependent Joint Activities in Security Games
  • Fei Fang, Albert X. Jiang and Milind Tambe. Optimal Patrol Strategy for Protecting Moving Targets with Multiple Mobile Resources
  • Archie Chapman and Pradeep Varakantham. Marginal Contribution Stochastic Games for Dynamic Resource Allocation: Bounds and Convergence
10:30 11:00 coffee break
11:00 — 12:30
  • Tom Jorquera, Jean-Pierre Georgé, Marie-Pierre Gleizes, Nicolas Couellan, Victor Noël and Christine Regis. A Natural Formalism and a Multi-Agent Algorithm for Integrative Multidisciplinary Design Optimization
  • Antonin Komenda, Robert N. Lass, Peter Novak, William Regli and Michal Pechoucek. Scalable and Robust Multi-agent Planning with Approximated DCOP
  • Kim Svensson, Sarvapali Ramchurn, Francisco Cruz, Juan-Antonio Rodriguez-Aguilar and Jesus Cerquides. Solving the Coalition Structure Generation Problem on a GPU
  • Michel WilsonCees WitteveenTomas Klos and Bob Huisman. Enhancing flexibility and robustness in multi-agent task scheduling
12:30 — 13:30 Lunch13:30 — 15:30
Keynote (60 mins) by Kagan Tumer: Multi-agent Systems in Optimization: Where do agents fit and what are they trying to do?
Panel (60 mins)  with Paul Scerri, Milind Tambe and Kagan Tumer
15:30 — 16:00 coffee break
16:00 — 17:30

List of Accepted Papers at OPTMAS 2013

The papers to be presented at OPTMAS 2013 in Minnesota are listed below. As you will see, the programme looks exciting as we have a strong set of papers cutting across human modelling and human-agent interaction. Coupled with our invited talk and a panel session,  OPTMAS 2013 promises to be engaging for participants of all types (students, professors, and industry).

If you wish to attend OPTMAS, please make sure you register for the workshop. You can register for AAMAS and the OPTMAS (W18) here.

  1. Trung Thanh Nguyen and Jörg Rothe. Envy-Ratio and Average-Nash Social Welfare Optimization in Multiagent Resource Allocation
  2. Tom Jorquera, Jean-Pierre Georgé, Marie-Pierre Gleizes, Nicolas Couellan, Victor Noël and Christine Regis. A Natural Formalism and a Multi-Agent Algorithm for Integrative Multidisciplinary Design Optimization
  3. Diane Villanueva, Rodolphe Le Riche, Gauthier Picard and Raphael Haftka. Self-organized Space Partitioning for Multi-Agent Optimization
  4. Eric Shieh, Manish Jain, Albert Jiang and Milind Tambe. Efficiently Solving Time-Dependent Joint Activities in Security Games
  5. Antonin Komenda, Robert N. Lass, Peter Novak, William Regli and Michal Pechoucek. Scalable and Robust Multi-agent Planning with Approximated DCOP
  6. Fei Fang, Albert X. Jiang and Milind Tambe. Optimal Patrol Strategy for Protecting Moving Targets with Multiple Mobile Resources
  7. Toni Penya-Alba, Meritxell Vinyals, Jesus Cerquides and Juan A. Rodriguez-Aguilar. Social Value Propagation for Supply Chain Formation
  8. Michel WilsonCees WitteveenTomas Klos and Bob Huisman. Enhancing flexibility and robustness in multi-agent task scheduling
  9. Archie Chapman and Pradeep Varakantham. Marginal Contribution Stochastic Games for Dynamic Resource Allocation: Bounds and Convergence
  10. Francisco Cruz Mencía, Jesus Cerquides, Toni Espinosa, Juan Carlos Moure, Sarvapali D. Ramchurn and Juan Antonio Rodriguez Aguilar. Coalition Structure Generation Problems: optimization and parallelization of the IDP algorithm
  11. Kim Svensson, Sarvapali Ramchurn, Francisco Cruz, Juan-Antonio Rodriguez-Aguilar and Jesus Cerquides. Solving the Coalition Structure Generation Problem on a GPU

Call for Papers

Aim

The number of novel applications of  multi-agent  systems  has  followed  an exponential trend over the last  few  years,  ranging  from  online  auction design, through multi-sensor networks, to scheduling of tasks  in  multi-actor systems. Multi-agent  systems  designed  for  all these  applications generally involve some form of very hard optimization problems that are substantially  different from problems traditionally dealt  with  in  other areas  (e.g.  industrial processes or scheduling  applications).

More  specifically,  the  technical issues that multi-agent algorithm designers have to deal with include :

  • Algorithms to compute solutions to mechanisms that deal with different stakeholders who  may  be  self  interested  or  may  have  different computation/communication capabilities from their peers.
  • Techniques to manage and disseminate relevant information across different agents.
  • Dealing with privacy concerns: solving complex  optimization  problems while leaking as little private information as possible
  • Problems that require anytime algorithms.
  • Approximate algorithms that need to provide  guarantees  on  the  quality of the solution.
  • Mechanisms whose properties  can  be  significantly  affected  if  the solution computed is not the optimal one.
  • Techniques to deal with optimizations that have to  be  repeated  with possibly only slight changes in the input data.
  • Techniques to deal  with  situations  where  the  input  data  may  be uncertain or unreliable, requiring that the solution computed be robust to slight differences from the true values.Techniques to deal with agents that are tied to physical devices. This involves computation and communication constraints that need to  be considered in the coordination techniques, as well as the possibility of failures of the devices and communication links.

Invited Talk

TBA

Important Dates

January 30, February 9th 2013 – Submission deadline.
– March 8, 2013 – Notification of acceptance.
– May 6-7, 2013 – Workshop takes place.

Keywords

  • Distributed Constraint Optimisation/Satisfaction
  • Winner Determination Algorithms in Auctions
  • Coalition Formation Algorithms
  • Algorithms to compute Nash Equilibrium in games
  • Optimisation under uncertainty
  • Optimisation with incomplete or dynamic input data
  • Algorithms for real-time applications

Submission and review

Submissions should conform to the LNCS Springer format,
Authors are encouraged to use the following style file
or see the Springer web site for more details.

Submission should not be more than 18 pages long (excluding appendices and assuming the LNCS format above).
Authors can submit their papers through the OPTMAS 2013 Easychair submission site here: https://www.easychair.org/conferences/?conf=optmas2013

Each paper will be reviewed by at least 2 reviewers. Criteria for selection of papers will include: originality, readability, relevance to themes,
soundness, and overall quality.

Publication
 
Best papers from OPTMAS 2008 and OPTMAS 2009 were selected for publication in the special issue on Optimisation in Multi-Agent System of the Journal of Autonomous and Multiagent Systems (http://www.springerlink.com/content/n7p264t41264).
Best papers from OPTMAS 2011 and 2012 were invited to submit to a special issue of the Computer Journal here.
We plan to continue this initiative.

 

Workshop Chairs

 Jesús Cerquides Bueno, IIIA – CSIC, Spain

Alessandro Farinelli, University of Verona, Italy

Sarvapali D. Ramchurn, University of Southampton, UK

Juan Antonio Rodriguez-Aguilar, IIIA – CSIC, Spain

Meritxell Vinyals, University of Verona, Italy

Archie Chapman, University of Sydney, Australia

Programme Committee

TBA