Publication:5501329
From MaRDI portal
zbMath1318.91092MaRDI QIDQ5501329
Edith Elkind, Amit Sahai, Kenneth Steiglitz
Publication date: 3 August 2015
90C35: Programming involving graphs or networks
91A10: Noncooperative games
91B26: Auctions, bargaining, bidding and selling, and other market models
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Preemptive Scheduling on Selfish Machines, Maximizing the Minimum Load for Selfish Agents, Frugal Routing on Wireless Ad-Hoc Networks, Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions, Truthful optimization using mechanisms with verification, Bounding the payment of approximate truthful mechanisms, Efficient money burning in general domains, Combinatorial auctions without money, A monotone approximation algorithm for scheduling with precedence constraints, The path player game, Maximizing the minimum load for selfish agents, Path auctions with multiple edge ownership, Auctions for social lending: a theoretical analysis, Optimal collusion-resistant mechanisms with verification, Mechanism design for policy routing, Fault tolerant mechanism design, The price of imperfect competition for a spanning network, On certain connectivity properties of the internet topology, How much can taxes help selfish routing?, First-passage percolation on a ladder graph, and the path cost in a VCG auction, Efficient Money Burning in General Domains