Show simple item record

dc.contributor.authorCarrasquel, José
dc.contributor.authorLupton, Gregory
dc.contributor.authorOprea, John
dc.contributor.editorCooper, Andrew A.
dc.contributor.editorCederbaum, Carla
dc.date.accessioned2018-08-10T09:46:48Z
dc.date.available2018-08-10T09:46:48Z
dc.date.issued2018-08-10
dc.identifier.urihttp://publications.mfo.de/handle/mfo/1384
dc.description.abstractTopological complexity is a number that measures how hard it is to plan motions (for robots, say) in terms of a particular space associated to the kind of motion to be planned. This is a burgeoning subject within the wider area of Applied Algebraic Topology. Surprisingly, the same mathematics gives insight into the question of creating social choice functions, which may be viewed as algorithms for making decisions by artificial intelligences.en_US
dc.language.isoenen_US
dc.publisherMathematisches Forschungsinstitut Oberwolfachen_US
dc.relation.ispartofseriesSnapshots of modern mathematics from Oberwolfach;2018,05
dc.rightsAttribution-ShareAlike 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/4.0/*
dc.titleTopological Complexity, Robotics and Social Choiceen_US
dc.typeArticleen_US
dc.identifier.doi10.14760/SNAP-2018-005-EN
local.series.idSNAP-2018-005-ENen_US
local.subject.snapshotGeometry and Topologyen_US
dc.identifier.urnurn:nbn:de:101:1-2018082015100294008165
dc.identifier.ppn1655211218


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-ShareAlike 4.0 International
Except where otherwise noted, this item's license is described as Attribution-ShareAlike 4.0 International