scientific article; zbMATH DE number 2065154

zbMATH Open1069.91032MaRDI QIDQ4459826FDOQ4459826

Ming-Yang Kao, Karhan Akcoglu, Bhaskar Dasgupta, James Aspnes

Publication date: 18 May 2004

Title of this publication is not available (Why is that?)

zbMATH Keywords

graphswinner determinationbudget constraintsopportunity costs

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Cited In (11)

• Spanning Trees With Edge Conflicts and Wireless Connectivity
• Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
• Effective Wireless Scheduling via Hypergraph Sketches
• Improved algorithms for resource allocation under varying capacity
• Temporal interval cliques and independent sets
• Inductive graph invariants and approximation algorithms
• Approximation algorithms for intersection graphs
• Hardness and approximation for L-EPG and \(B_1\)-EPG graphs
• Network design under general wireless interference
• Independent sets in Line of Sight networks
• Efficient job scheduling algorithms with multi-type contentions

   Recommendations

• Algorithm Theory - SWAT 2004 👍 👎
• Algorithm for optimal winner determination in combinatorial auctions 👍 👎
• Computationally manageable combinational auctions 👍 👎
• Approximation algorithms for combinatorial auctions with complement-free bidders 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q4459826)