scientific article; zbMATH DE number 2119764
From MaRDI portal
Publication:4829039
zbMath1093.68609MaRDI QIDQ4829039
Publication date: 29 November 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)
Related Items (23)
Approximation and collusion in multicast cost sharing ⋮ Coordination mechanisms ⋮ Mechanism design for policy routing ⋮ Fault tolerant mechanism design ⋮ Diffusion auction design ⋮ Distributed algorithmic mechanism design for scheduling on unrelated machines ⋮ The price of imperfect competition for a spanning network ⋮ A BGP-based mechanism for lowest-cost routing ⋮ Bounding the payment of approximate truthful mechanisms ⋮ Computationally-feasible truthful auctions for convex bundles ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ First-passage percolation on a ladder graph, and the path cost in a VCG auction ⋮ Spanning tree auctions: a complete characterization ⋮ On certain connectivity properties of the internet topology ⋮ Auctions for social lending: a theoretical analysis ⋮ How much can taxes help selfish routing? ⋮ Competitive auctions ⋮ An incentive compatible, efficient market for air traffic flow management ⋮ Preemptive Scheduling on Selfish Machines ⋮ Maximizing the Minimum Load for Selfish Agents ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ The path player game ⋮ Path auctions with multiple edge ownership
This page was built for publication:
