共 50 条
- [1] Communication Complexity of Combinatorial Auctions with Submodular Valuations PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1205 - 1215
- [2] The computational complexity of dynamic programming algorithm for combinatorial auctions 2002 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-4, PROCEEDINGS, 2002, : 266 - 268
- [3] Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches IJCAI International Joint Conference on Artificial Intelligence, 1999, 1 : 548 - 553
- [5] On The Complexity of Combinatorial Auctions: Structured Item Graphs and Hypertree Decompositions EC'07: PROCEEDINGS OF THE EIGHTH ANNUAL CONFERENCE ON ELECTRONIC COMMERCE, 2007, : 152 - 161
- [6] Complexity and Tractability Islands for Combinatorial Auctions on Discrete Intervals with Gaps ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 802 - 809
- [7] Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, 1999, : 548 - 553
- [8] Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers 2019 IEEE 60TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2019), 2019, : 249 - 272