Multi-Objective Variable Elimination for Collaborative Graphical Games
| Authors |
|
|---|---|
| Publication date | 2013 |
| Book title | AAMAS'13 |
| Book subtitle | proceedings of the 2013 International Conference on Autonomous Agents & Multiagent Systems : May 6-10, 2013, St. Paul, MN, USA |
| ISBN (electronic) |
|
| Event | 2013 International Conference on Autonomous Agents |
| Volume | Issue number | 2 |
| Pages (from-to) | 1209-1210 |
| Publisher | Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems |
| Organisations |
|
| Abstract | In this paper we propose multi-objective variable elimination (MOVE), an efficient solution method for multi-objective collaborative graphical games (MO-CoGGs), that exploits loose couplings. MOVE computes the convex coverage set, which can be much smaller than the Pareto front. In an empirical study, we show that MOVE can tackle multi-objective problems much faster than methods that do not exploit loose couplings. |
| Document type | Conference contribution |
| Note | Extended abstract |
| Language | English |
| Published at | http://dl.acm.org/citation.cfm?id=2485146 http://www.aamas-conference.org/Proceedings/aamas2013/docs/p1209.pdf |
| Downloads |
p1209-roijers
(Final published version)
|
| Permalink to this page | |