The following pages link to (Q4829039):
Displayed 21 items.
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Spanning tree auctions: a complete characterization (Q518710) (← links)
- Distributed algorithmic mechanism design for scheduling on unrelated machines (Q635328) (← links)
- Coordination mechanisms (Q838145) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- The path player game (Q1006556) (← links)
- Path auctions with multiple edge ownership (Q1041251) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- Auctions for social lending: a theoretical analysis (Q2016244) (← links)
- Mechanism design for policy routing (Q2375297) (← links)
- Fault tolerant mechanism design (Q2389683) (← links)
- The price of imperfect competition for a spanning network (Q2436294) (← links)
- On certain connectivity properties of the internet topology (Q2490261) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- Competitive auctions (Q2506308) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- Preemptive Scheduling on Selfish Machines (Q5458506) (← links)
- Maximizing the Minimum Load for Selfish Agents (Q5458534) (← links)
- Frugal Routing on Wireless Ad-Hoc Networks (Q5459979) (← links)