scientific article; zbMATH DE number 2065154

MaRDI QIDQ4459826zbMATH OpenFDO

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

Publication date 18 May 2004

zbMATH Keywords

graphswinner determinationbudget constraintsopportunity costs

Mathematics Subject Classification ID

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

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
• scientific article; zbMATH DE number 1833405

Cited in

(12)

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

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)