The following pages link to (Q5501329):
Displaying 25 items.
- Truthful optimization using mechanisms with verification (Q391782) (← links)
- Bounding the payment of approximate truthful mechanisms (Q476890) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- A monotone approximation algorithm for scheduling with precedence constraints (Q935240) (← links)
- The path player game (Q1006556) (← links)
- Maximizing the minimum load for selfish agents (Q1041221) (← links)
- Path auctions with multiple edge ownership (Q1041251) (← links)
- Convergence of VCG mechanism to ex-post budget balance in a model of land acquisition (Q1642157) (← links)
- Auctions for social lending: a theoretical analysis (Q2016244) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← 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)
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location (Q2659777) (← links)
- Diffusion auction design (Q2667812) (← links)
- First-passage percolation on a ladder graph, and the path cost in a VCG auction (Q2998892) (← links)
- Efficient Money Burning in General Domains (Q3449584) (← 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)
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions (Q5900469) (← links)
- An incentive compatible, efficient market for air traffic flow management (Q5918109) (← links)
