Winner determination in combinatorial auctions with logic-based bidding languages
暂无分享,去创建一个
[1] Craig Boutilier,et al. Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.
[2] Craig Boutilier,et al. Solving concisely expressed combinatorial auction problems , 2002, AAAI/IAAI.
[3] Gadi Pinkas,et al. Propositional Non-Monotonic Reasoning and Inconsistency in Symmetric Neural Networks , 1991, IJCAI.
[4] Yoav Shoham,et al. Towards a universal test suite for combinatorial auction algorithms , 2000, EC '00.
[5] Craig Boutilier,et al. Bidding Languages for Combinatorial Auctions , 2001, IJCAI.
[6] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[7] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[8] Jérôme Lang,et al. Logical Preference Representation and Combinatorial Vote , 2004, Annals of Mathematics and Artificial Intelligence.
[9] Yann Chevaleyre,et al. Expressive Power of Weighted Propositional Formulas for Cardinal Preference Modeling , 2006, KR.
[10] Michel Gendreau,et al. Combinatorial auctions , 2007, Ann. Oper. Res..