Algorithmic Economics und Operations Research
暂无分享,去创建一个
[1] Rainer Kolisch,et al. Optimizing Inbound Baggage Handling at Airports , 2017, Transp. Sci..
[2] Robert E. Bixby,et al. A Brief History of Linear and Mixed-Integer Programming Computation , 2012 .
[3] Susanne Albers,et al. On Approximate Nash Equilibria in Network Design , 2013, Internet Math..
[4] Peter Gritzmann,et al. Geometric Clustering for the Consolidation of Farmland and Woodland , 2014 .
[5] Peter Gritzmann,et al. Computational Convexity , 1996, Handbook of Discrete and Computational Geometry, 2nd Ed..
[6] Scott Shenker,et al. On a network creation game , 2003, PODC '03.
[7] Martin Bichler,et al. Generalized assignment problem: Truthful mechanism design without money , 2016, Oper. Res. Lett..
[8] Martin Bichler,et al. Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules , 2013, Inf. Syst. Res..
[9] J. Goeree,et al. Handbook of Spectrum Auction Design , 2017 .
[10] Jorge Cortés,et al. Coverage Optimization and Spatial Load Balancing by Robotic Sensor Networks , 2010, IEEE Transactions on Automatic Control.
[11] Sushil Bikhchandani,et al. The Package Assignment Model , 2002, J. Econ. Theory.
[12] Peter Gritzmann,et al. Constrained clustering via diagrams: A unified theory and its application to electoral district design , 2017, Eur. J. Oper. Res..
[13] Susanne Albers,et al. On the value of coordination in network design , 2008, SODA '08.
[14] Felix Brandt,et al. Finding strategyproof social choice functions via SAT solving , 2014, AAMAS.
[15] Tim Roughgarden,et al. Algorithmic Game Theory , 2007 .
[16] Erik Carlsson,et al. Balancing workloads of service vehicles over a geographic territory , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[17] Peter Gritzmann,et al. Electoral District Design via Constrained Clustering , 2017, ArXiv.
[18] Martin Bichler,et al. Compact Bid Languages and Core Pricing in Large Multi-item Auctions , 2015, Manag. Sci..
[19] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.
[20] P. Gritzmann,et al. Generalized balanced power diagrams for 3D representations of polycrystals , 2014, 1411.4535.
[21] Martin Bichler,et al. Matching with indifferences: A comparison of algorithms in the context of course allocation , 2017, Eur. J. Oper. Res..
[22] Rainer Kolisch,et al. Column Generation for Outbound Baggage Handling at Airports , 2017, Transp. Sci..
[23] Vincent Conitzer,et al. Handbook of Computational Social Choice , 2016 .
[24] Felix Brandt,et al. Proving the Incompatibility of Efficiency and Strategyproofness via SMT Solving , 2016, IJCAI.
[25] Éva Tardos,et al. Near-Optimal Network Design with Selfish Agents , 2008, Theory Comput..
[26] Edith Elkind,et al. Computational Social Choice: The First Ten Years and Beyond , 2019, Computing and Software Science.
[27] William L. Maxwell,et al. Theory of scheduling , 1967 .
[28] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[29] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[30] Felix Brandt,et al. Consistent Probabilistic Social Choice , 2015, ArXiv.