scientific article; zbMATH DE number 6469211

zbMath1318.91092MaRDI QIDQ5501329

Amit Sahai, Kenneth Steiglitz, Edith Elkind

Publication date: 3 August 2015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Noncooperative games (91A10) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (25)

Efficient Money Burning in General Domains ⋮ Mechanism design for policy routing ⋮ Convergence of VCG mechanism to ex-post budget balance in a model of land acquisition ⋮ Fault tolerant mechanism design ⋮ Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location ⋮ Diffusion auction design ⋮ Truthful optimization using mechanisms with verification ⋮ The price of imperfect competition for a spanning network ⋮ Bounding the payment of approximate truthful mechanisms ⋮ A monotone approximation algorithm for scheduling with precedence constraints ⋮ First-passage percolation on a ladder graph, and the path cost in a VCG auction ⋮ Efficient money burning in general domains ⋮ Combinatorial auctions without money ⋮ On certain connectivity properties of the internet topology ⋮ Auctions for social lending: a theoretical analysis ⋮ Optimal collusion-resistant mechanisms with verification ⋮ How much can taxes help selfish routing? ⋮ 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 ⋮ Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions ⋮ Maximizing the minimum load for selfish agents ⋮ Path auctions with multiple edge ownership

This page was built for publication: