Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-007-9016-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2064284967 / rank | |||
Normal rank | |||
Revision as of 20:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and approximate truthful mechanisms for the shortest paths tree problem |
scientific article |
Statements
Exact and approximate truthful mechanisms for the shortest paths tree problem (English)
0 references
28 November 2007
0 references
Single-source shortest paths tree
0 references
Selfish agents
0 references
Algorithmic mechanism design
0 references
Truthful mechanisms
0 references
