Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem

Autor:	Bilo', D., Guala', L., Proietti, G.
Rok vydání:	2006
Zdroj:	Lecture notes in computer science 4235 (2006): 19–30. info:cnr-pdr/source/autori:Bilo', D.; Guala', L.; Proietti, G./titolo:Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem/doi:/rivista:Lecture notes in computer science/anno:2006/pagina_da:19/pagina_a:30/intervallo_pagine:19–30/volume:4235
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=cnr_________::145254da18951ec612257fd3c7c78864 https://publications.cnr.it/doc/7294 Zobrazit plný text záznamu