Pages that link to "Item:Q2461546"
From MaRDI portal
The following pages link to Exact and approximate truthful mechanisms for the shortest paths tree problem (Q2461546):
Displaying 8 items.
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- A faster computation of all the best swap edges of a shortest paths tree (Q893317) (← links)
- Dynamic mechanism design (Q1014626) (← links)
- Strongly polynomial-time truthful mechanisms in one shot (Q1014632) (← links)
- Path auctions with multiple edge ownership (Q1041251) (← links)
- No truthful mechanism can be better than \(n\) approximate for two natural problems (Q1792559) (← links)
- New bounds for truthful scheduling on two unrelated selfish machines (Q2300622) (← links)
- Path-Fault-Tolerant Approximate Shortest-Path Trees (Q3460718) (← links)