All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

epsilon-Strong Privacy Preserving Multiagent Planner by Computational Tractability

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00315610" target="_blank" >RIV/68407700:21230/17:00315610 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0006176400510057" target="_blank" >http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0006176400510057</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.5220/0006176400510057" target="_blank" >10.5220/0006176400510057</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    epsilon-Strong Privacy Preserving Multiagent Planner by Computational Tractability

  • Original language description

    Classical planning can solve large and real-world problems, even when multiple entities, such as robots, trucks or companies, are concerned. But when the interested parties, such as cooperating companies, are interested in maintaining their privacy while planning, classical planning cannot be used. Although, privacy is one of the crucial aspects of multi-agent planning, studies of privacy are underepresented in the literature. A strong privacy property, necessary to leak no information at all, has not been achieved by any planner in general yet. In this contribution, we propose a multiagent planner which can get arbitrarily close to the general strong privacy preserving planner for the price of decreased planning efficiency. The strong privacy assurances are under computational tractability assumptions commonly used in secure computation research.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GJ15-20433Y" target="_blank" >GJ15-20433Y: Heuristic Search for Multiagent and Factored Planning</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 9th International Conference on Agents and Artificial Intelligence

  • ISBN

    978-989-758-219-6

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    51-57

  • Publisher name

    SciTePress

  • Place of publication

    Madeira

  • Event location

    Porto

  • Event date

    Feb 24, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000413243500004