scientific article; zbMATH DE number 1962848

MaRDI QIDQ4418685zbMATH OpenFDO

Authors Kunal Talwar

Publication date 11 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2607/26070608.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Frugal path mechanisms
• scientific article; zbMATH DE number 2119764
• Frugality in path auctions
• Computationally feasible VCG mechanisms
• No truthful mechanism can be better than n approximate for two natural problems

Cited in

(22)

• Setting lower bounds on truthfulness
• Auctions for social lending: a theoretical analysis
• Envy freedom and prior-free mechanism design
• The price of imperfect competition for a spanning network
• How much can taxes help selfish routing?
• Competitive auctions
• Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
• Frugal path mechanisms
• Reducing truth-telling online mechanisms to online optimization
• scientific article; zbMATH DE number 5547975 (Why is no real title available?)
• Does Competition Affect Truth Telling? An Experiment with Rating Agencies*
• scientific article; zbMATH DE number 2163018 (Why is no real title available?)
• Bounding the payment of approximate truthful mechanisms
• scientific article; zbMATH DE number 2119764 (Why is no real title available?)
• Persuasion, binary choice, and the costs of dishonesty
• Commodity auctions and frugality ratios
• Using Nash Implementation to Achieve Better Frugality Ratios
• Frugal Routing on Wireless Ad-Hoc Networks
• Frugality in path auctions
• Algorithms and Computation
• scientific article; zbMATH DE number 7650127 (Why is no real title available?)
• Successive minimum spanning trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418685)