Integer and combinatorial optimization
Integer and combinatorial optimization
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Introduction to Linear Optimization
Introduction to Linear Optimization
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Self-correcting sampling-based dynamic multi-unit auctions
Proceedings of the 10th ACM conference on Electronic commerce
GROWRANGE: anytime VCG-based mechanisms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
An ironing-based approach to adaptive online mechanism design in single-valued domains
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Bayesian algorithmic mechanism design
Proceedings of the forty-second ACM symposium on Theory of computing
Bayesian incentive compatibility via matchings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Automated configuration of mixed integer programming solvers
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
Faced with an intractable optimization problem, a common approach to computational mechanism design seeks a polynomial time approximation algorithm with an approximation guarantee. Rather than adopt this worst-case viewpoint, we introduce a new paradigm that seeks to obtain good performance on typical instances through a modification to the branch-and-bound search paradigm. Incentive compatibility in single-dimensional domains requires that an outcome improves monotonically for an agent as the agent's reported value increases. We obtain a monotone search algorithm by coupling an explicit sensitivity analysis on the decisions made during search with a correction to the outcome to ensure monotonicity. Extensive computational experiments on single-minded combinatorial auctions show better welfare performance than that available from existing approximation algorithms.