No abstract available.
Cited By
- Li Q, Jia X and Huang C (2023). A truthful dynamic combinatorial double auction model for cloud resource allocation, Journal of Cloud Computing: Advances, Systems and Applications, 12:1, Online publication date: 18-Jul-2023.
- Bünz B, Lubin B and Seuken S (2022). Designing Core-Selecting Payment Rules, Information Systems Research, 33:4, (1157-1173), Online publication date: 1-Dec-2022.
- Budish E and Kessler J (2022). Can Market Participants Report Their Preferences Accurately (Enough)?, Management Science, 68:2, (1107-1130), Online publication date: 1-Feb-2022.
- Tripathy M, Ahmed R and Kay M On-demand logistics service for packages Proceedings of the Winter Simulation Conference, (1-12)
- Chen Y, Cramton P, List J and Ockenfels A (2021). Market Design, Human Behavior, and Management, Management Science, 67:9, (5317-5348), Online publication date: 1-Sep-2021.
- Abdallah T, Asadpour A and Reed J (2021). Large-Scale Bundle-Size Pricing, Operations Research, 69:4, (1158-1185), Online publication date: 1-Jul-2021.
- Deng Y, Panigrahi D and Zhang H Online combinatorial auctions Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (1131-1149)
- Fikioris G and Fotakis D Mechanism Design for Perturbation Stable Combinatorial Auctions Algorithmic Game Theory, (47-63)
- Derinkuyu K, Tanrisever F, Kurt N and Ceyhan G (2020). Optimizing Day-Ahead Electricity Market Prices, Manufacturing & Service Operations Management, 22:4, (700-716), Online publication date: 1-Jul-2020.
- Gonen R and Egri O (2020). COMBIMA: truthful, budget maintaining, dynamic combinatorial market, Autonomous Agents and Multi-Agent Systems, 34:1, Online publication date: 25-Mar-2020.
- Luong N, Wang P, Niyato D, Liang Y, Han Z and Hou F (2019). Applications of Economic and Pricing Models for Resource Management in 5G Wireless Networks: A Survey, IEEE Communications Surveys & Tutorials, 21:4, (3298-3339), Online publication date: 1-Oct-2019.
- Zhang M, Huang G, Xu S and Zhao Z (2019). Optimization based transportation service trading in B2B e-commerce logistics, Journal of Intelligent Manufacturing, 30:7, (2603-2619), Online publication date: 1-Oct-2019.
- Adomavicius G, Gupta A and Yang M (2019). Designing real-time feedback for bidders in homogeneous-item continuous combinatorial auctions, MIS Quarterly, 43:3, (721-744), Online publication date: 1-Sep-2019.
- Kominers S (2019). Good markets (really do) make good neighbors, ACM SIGecom Exchanges, 16:2, (12-26), Online publication date: 7-May-2019.
- Briskorn D, Jaehn F and Wiehl A (2019). A generator for test instances of scheduling problems concerning cranes in transshipment terminals, OR Spectrum, 41:1, (45-69), Online publication date: 1-Mar-2019.
- Bichler M, Fux V and Goeree J (2018). A Matter of Equality, Information Systems Research, 29:4, (1024-1043), Online publication date: 1-Dec-2018.
- Manzinger S and Althoff M Tactical Decision Making for Cooperative Vehicles Using Reachable Sets 2018 21st International Conference on Intelligent Transportation Systems (ITSC), (444-451)
- Fernández-Martínez J, López-Sánchez M, Aguilar J, Rubio D and Nemegyei B (2018). Co-Designing Participatory Tools for a New Age, International Journal of Public Administration in the Digital Age, 5:4, (1-17), Online publication date: 1-Oct-2018.
- Gerstl D Applying Auctions to Bank Holding Company Software Project Portfolio Selection Economics of Grids, Clouds, Systems, and Services, (9-23)
- Pourkabirian A, Dehghan Takht Fooladi M, Zeinali E and Rahmani A (2018). Dynamic resource allocation for OFDMA femtocell networks, Telecommunications Systems, 69:1, (51-59), Online publication date: 1-Sep-2018.
- Bosshard V, Wang Y and Seuken S Non-decreasing payment rules for combinatorial auctions Proceedings of the 27th International Joint Conference on Artificial Intelligence, (105-113)
- Hajiaghayi M, Khani M and Seddighin S Frugal Auction Design for Set Systems Proceedings of the 2018 ACM Conference on Economics and Computation, (645-662)
- Candogan O, Ozdaglar A and Parrilo P (2018). Pricing Equilibria and Graphical Valuations, ACM Transactions on Economics and Computation, 6:1, (1-26), Online publication date: 13-Mar-2018.
- Döcker J, Dorn B, Endriss U, de Haan R and Schneckenburger S Tool auctions Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (1015-1022)
- Gonen R and Egri O DYCOM Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (1556-1558)
- Areyan Viqueira E, Greenwald A and Naroditskiy V On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (1466-1468)
- Azar Y, Hoefer M, Maor I, Reiffenhäuser R and Vöcking B (2017). Truthful mechanism design via correlated tree rounding, Mathematical Programming: Series A and B, 163:1-2, (445-469), Online publication date: 1-May-2017.
- Luong N, Wang P, Niyato D, Wen Y and Han Z (2017). Resource Management in Cloud Networking Using Economic Analysis and Pricing Models: A Survey, IEEE Communications Surveys & Tutorials, 19:2, (954-1001), Online publication date: 1-Apr-2017.
- Maehara T, Kawase Y, Sumita H, Tono K and Kawarabayashi K Optimal pricing for submodular valuations with bounded curvature Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (622-628)
- Niazadeh R and Wilkens C Competitive Equilibria for Non-quasilinear Bidders in Combinatorial Auctions Proceedings of the 12th International Conference on Web and Internet Economics - Volume 10123, (116-130)
- Dughmi S, Roughgarden T and Yan Q (2016). Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding, Journal of the ACM, 63:4, (1-33), Online publication date: 8-Nov-2016.
- Borodin A and Lucier B (2016). On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions, ACM Transactions on Economics and Computation, 5:1, (1-23), Online publication date: 3-Nov-2016.
- Bhamare D, Jain R, Samaka M and Erbad A (2016). A survey on service function chaining, Journal of Network and Computer Applications, 75:C, (138-155), Online publication date: 1-Nov-2016.
- Wu F, Zhang T, Qiao C and Chen G (2016). A Strategy-Proof Auction Mechanism for Adaptive-Width Channel Allocation in Wireless Networks, IEEE Journal on Selected Areas in Communications, 34:10, (2678-2689), Online publication date: 1-Oct-2016.
- Feldman M, Friedler O, Morgenstern J and Reiner G Simple Mechanisms for Agents with Complements Proceedings of the 2016 ACM Conference on Economics and Computation, (251-267)
- Andersen G and Conitzer V ATUCAPTS Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (3662-3669)
- Gottlob G, Greco G, Leone N and Scarcello F Hypertree Decompositions Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (57-74)
- Aumann Y, Dombb Y and Hassidim A (2016). Auctioning Time, ACM Transactions on Economics and Computation, 4:1, (1-16), Online publication date: 5-Jan-2016.
- Zhang Y, Li B, Huang Z, Wang J and Zhu J (2015). SGAM, Concurrency and Computation: Practice & Experience, 27:18, (5577-5589), Online publication date: 25-Dec-2015.
- Cheung Y, Henzinger M, Hoefer M and Starnberger M Combinatorial Auctions with Conflict-Based Externalities Web and Internet Economics, (230-243)
- Kotkowski M, Nguyen H, Getahun Y and Mago V A Novel Agent Based Method for Intelligent Public Transportation System Proceedings of the 1st International ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics, (85-93)
- Yang L, Hanneke S and Carbonell J Bounds on the Minimax Rate for Estimating a Prior over a VC Class from Independent Learning Tasks Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (270-284)
- Even G and Halabi N (2015). Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming, IEEE Transactions on Information Theory, 61:10, (5295-5305), Online publication date: 1-Oct-2015.
- Roughgarden T and Talgam-Cohen I Why Prices Need Algorithms Proceedings of the Sixteenth ACM Conference on Economics and Computation, (19-36)
- Caminati M, Kerber M, Lange C and Rowat C Sound Auction Specification and Implementation Proceedings of the Sixteenth ACM Conference on Economics and Computation, (547-564)
- Azar Y, Hoefer M, Maor I, Reiffenhäuser R and Vöcking B Truthful Mechanism Design via Correlated Tree Rounding Proceedings of the Sixteenth ACM Conference on Economics and Computation, (415-432)
- Iwasaki A, Ueda S, Hashimoto N and Yokoo M (2015). Finding core for coalition structure utilizing dual solution, Artificial Intelligence, 222:C, (49-66), Online publication date: 1-May-2015.
- Feiran Wang , Chen Xu , Lingyang Song and Zhu Han (2015). Energy-Efficient Resource Allocation for Device-to-Device Underlay Communication, IEEE Transactions on Wireless Communications, 14:4, (2082-2092), Online publication date: 1-Apr-2015.
- Wu Q and Hao J (2015). Solving the winner determination problem via a weighted maximum clique heuristic, Expert Systems with Applications: An International Journal, 42:1, (355-365), Online publication date: 1-Jan-2015.
- Hoefer M, Kesselheim T and Vöcking B (2014). Approximation Algorithms for Secondary Spectrum Auctions, ACM Transactions on Internet Technology, 14:2-3, (1-24), Online publication date: 28-Oct-2014.
- Ramanathan S, Kasinathan A and Sen A Incremental solutions to online multi-unit combinatorial auctions for information feedback Proceedings of the 2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, (882-889)
- Nguyen T and Sandholm T Optimizing prices in descending clock auctions Proceedings of the fifteenth ACM conference on Economics and computation, (93-110)
- Chen W, He D, Liu T, Qin T, Tao Y and Wang L Generalized second price auction with probabilistic broad match Proceedings of the fifteenth ACM conference on Economics and computation, (39-56)
- Lesca J, Todo T and Yokoo M Coexistence of utilitarian efficiency and false-name-proofness in social choice Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (1201-1208)
- Aumann Y, Dombb Y and Hassidim A Auctioning a cake Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (1045-1052)
- Fukuta N A Market-Based Agent-Mediated Resource Control Framework for Middle-Scale Smart Grids Proceedings of the 2013 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT) - Volume 03, (292-293)
- Sghir I, Hao J, Ben Jaafar I and Ghédira K A Recombination-Based Tabu Search Algorithm for the Winner Determination Problem Artificial Evolution, (157-167)
- Gottlob G and Greco G (2013). Decomposing combinatorial auctions and set packing problems, Journal of the ACM, 60:4, (1-39), Online publication date: 1-Aug-2013.
- Lange C, Caminati M, Kerber M, Mossakowski T, Rowat C, Wenzel M and Windsteiger W A qualitative comparison of the suitability of four theorem provers for basic auction theory Proceedings of the 2013 international conference on Intelligent Computer Mathematics, (200-215)
- Endriss U Reduction of economic inequality in combinatorial domains Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems, (175-182)
- Zaman S and Grosu D (2013). Combinatorial auction-based allocation of virtual machine instances in clouds, Journal of Parallel and Distributed Computing, 73:4, (495-508), Online publication date: 1-Apr-2013.
- Bhawalkar K and Roughgarden T Simultaneous single-item auctions Proceedings of the 8th international conference on Internet and Network Economics, (337-349)
- Sakurai Y and Yokoo M Generalized Partition Mechanism Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02, (502-509)
- Fukuta N and Ito T A Preliminary Experimental Analysis on Combinatorial Auction-Based Electric Power Allocation for Manufacturing Industries Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03, (394-398)
- Hashimoto S, Kanamori R, Ito T and Chakraborty S Evaluation of Parking Reservation System with Auction Including Electricity Trading Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03, (389-393)
- Robu V, Mous L and La Poutré H (2012). Using Priced Options to Solve the Exposure Problem in Sequential Auctions, ACM Transactions on Internet Technology, 12:2, (1-39), Online publication date: 1-Dec-2012.
- Wellman M, Sodomka E and Greenwald A Self-confirming price prediction strategies for simultaneous one-shot auctions Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence, (893-902)
- Olivares M, Weintraub G, Epstein R and Yung D (2012). Combinatorial Auctions for Procurement, Management Science, 58:8, (1458-1481), Online publication date: 1-Aug-2012.
- Zhang K, Collins E and Shi D (2012). Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction, ACM Transactions on Autonomous and Adaptive Systems, 7:2, (1-22), Online publication date: 1-Jul-2012.
- Croitoru M and Rudolph S Exclusivity-based allocation of knowledge Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1249-1250)
- Bro Miltersen P and Sheffet O Send mixed signals Proceedings of the 13th ACM Conference on Electronic Commerce, (234-247)
- Abraham I, Babaioff M, Dughmi S and Roughgarden T Combinatorial auctions with restricted complements Proceedings of the 13th ACM Conference on Electronic Commerce, (3-16)
- Hua X On envy-free pareto efficient pricing Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management, (70-81)
- Zaman S and Grosu D Combinatorial Auction-Based Mechanisms for VM Provisioning and Allocation in Clouds Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012), (729-734)
- Day R and Cramton P (2012). Quadratic Core-Selecting Payment Rules for Combinatorial Auctions, Operations Research, 60:3, (588-603), Online publication date: 1-May-2012.
- Radovanovic A and Heavlin W Risk-aware revenue maximization in display advertising Proceedings of the 21st international conference on World Wide Web, (91-100)
- Papadimitriou P and Garcia-Molina H Sponsored search auctions with conflict constraints Proceedings of the fifth ACM international conference on Web search and data mining, (283-292)
- Dobzinski S, Nisan N and Schapira M (2012). Truthful randomized mechanisms for combinatorial auctions, Journal of Computer and System Sciences, 78:1, (15-25), Online publication date: 1-Jan-2012.
- Fukuta N and Ito T An approach to sustainable electric power allocation using a multi-round multi-unit combinatorial auction Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing, (48-63)
- Mikhaylov B, Cerquides J and Rodriguez-Aguilar J Solving sequential mixed auctions with integer programming Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence, (42-53)
- Huang H, Kauffman R, Xu H and Zhao L (2011). Mechanism design for e-procurement auctions, Electronic Commerce Research and Applications, 10:6, (650-672), Online publication date: 1-Nov-2011.
- Fotakis D, Krysta P and Telelis O Externalities among advertisers in sponsored search Proceedings of the 4th international conference on Algorithmic game theory, (105-116)
- Ackermann H, Ewe H, Kopfer H and Küfer K Combinatorial auctions in freight logistics Proceedings of the Second international conference on Computational logistics, (1-17)
- Kurve A, Griffin C and Kesidis G A graph partitioning game for distributed simulation of networks Proceedings of the 2011 International Workshop on Modeling, Analysis, and Control of Complex Networks, (9-16)
- Shioura A Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints Proceedings of the 19th European conference on Algorithms, (1-12)
- Fukuta N Toward a VCG-Like Approximate Mechanism for Large-Scale Multi-unit Combinatorial Auctions Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02, (317-322)
- Mikhaylov B, Cerquides J and Rodriguez-Aguilar J Sequential mixed auctions Proceedings of the 13th International Conference on Electronic Commerce, (1-6)
- Dughmi S, Roughgarden T and Yan Q From convex optimization to randomized mechanisms Proceedings of the forty-third annual ACM symposium on Theory of computing, (149-158)
- Hoefer M, Kesselheim T and Vöcking B Approximation algorithms for secondary spectrum auctions Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, (177-186)
- Chen J, Huang H and Kauffman R (2011). A public procurement combinatorial auction mechanism with quality assignment, Decision Support Systems, 51:3, (480-492), Online publication date: 1-Jun-2011.
- Vorobeychik Y and Engel Y (2011). Average-case analysis of VCG with approximate resource allocation algorithms, Decision Support Systems, 51:3, (648-656), Online publication date: 1-Jun-2011.
- Shioura A and Suzuki S Optimal allocation in combinatorial auctions with quadratic utility functions Proceedings of the 8th annual conference on Theory and applications of models of computation, (142-153)
- An B, Lesser V, Westbrook D and Zink M Agent-mediated multi-step optimization for resource allocation in distributed sensor networks The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (609-616)
- Iwasaki A, Katsuragi A and Yokoo M False-name bidding in first-price combinatorial auctions with incomplete information The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (541-548)
- Durán G, Epstein R, Martinez C and Zamorano G (2011). Quantitative Methods for a New Configuration of Territorial Units in a Chilean Government Agency Tender Process, Interfaces, 41:3, (263-277), Online publication date: 1-May-2011.
- Domshlak C, Hüllermeier E, Kaci S and Prade H (2011). Preferences in AI, Artificial Intelligence, 175:7-8, (1037-1052), Online publication date: 1-May-2011.
- Bellosta M, Kornman S and Vanderpooten D (2011). Preference-based English reverse auctions, Artificial Intelligence, 175:7-8, (1449-1467), Online publication date: 1-May-2011.
- Conitzer V and Sandholm T (2011). Expressive markets for donating to charities, Artificial Intelligence, 175:7-8, (1251-1271), Online publication date: 1-May-2011.
- Chaikijwatana P and Tachibana T VCG auction-based bandwidth allocation with network coding in wireless networks Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science, (104-109)
- Vanmechelen K, Depoorter W and Broeckhove J (2011). Combining Futures and Spot Markets, Journal of Grid Computing, 9:1, (81-94), Online publication date: 1-Mar-2011.
- Rastegari B, Condon A and Leyton-Brown K (2011). Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions, Artificial Intelligence, 175:2, (441-456), Online publication date: 1-Feb-2011.
- Parsons S, Rodriguez-Aguilar J and Klein M (2011). Auctions and bidding, ACM Computing Surveys, 43:2, (1-59), Online publication date: 1-Jan-2011.
- Van den Bossche R, Vanmechelen K and Broeckhove J (2011). An evaluation of the benefits of fine-grained value-based scheduling on general purpose clusters, Future Generation Computer Systems, 27:1, (1-9), Online publication date: 1-Jan-2011.
- Vorobeychik Y and Engel Y Average-case analysis of mechanism design with approximate resource allocation algorithms Proceedings of the 6th international conference on Internet and network economics, (571-578)
- Sakurai Y, Iwasaki A and Yokoo M (2010). Keyword auction protocol for dynamically adjusting the number of advertisements, Web Intelligence and Agent Systems, 8:4, (331-341), Online publication date: 1-Dec-2010.
- Ceppi S and Gatti N (2010). An algorithmic game theory study of wholesale electricity markets based on central auction, Integrated Computer-Aided Engineering, 17:4, (273-290), Online publication date: 1-Dec-2010.
- Parkes D, Cavallo R, Constantin F and Singh S (2010). Dynamic Incentive Mechanisms, AI Magazine, 31:4, (79-94), Online publication date: 1-Dec-2010.
- Elkind E and Leyton‐Brown K (2010). Algorithmic Game Theory, AI Magazine, 31:4, (9-12), Online publication date: 1-Dec-2010.
- Papadimitriou P, Garcia-Molina H, Dasdan A and Kolay S (2010). Output URL bidding, Proceedings of the VLDB Endowment, 4:3, (161-172), Online publication date: 1-Dec-2010.
- Kasbekar G and Sarkar S (2010). Spectrum auction framework for access allocation in cognitive radio networks, IEEE/ACM Transactions on Networking, 18:6, (1841-1854), Online publication date: 1-Dec-2010.
- Bharadwaj V, Ma W, Schwarz M, Shanmugasundaram J, Vee E, Xie J and Yang J Pricing guaranteed contracts in online display advertising Proceedings of the 19th ACM international conference on Information and knowledge management, (399-408)
- Uckelman J and Endriss U (2010). Compactly representing utility functions using weighted goals and the max aggregator, Artificial Intelligence, 174:15, (1222-1246), Online publication date: 1-Oct-2010.
- Di Mauro N, Basile T, Ferilli S and Esposito F Coalition structure generation with GRASP Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications, (111-120)
- Vorobeychik Y (2010). Probabilistic analysis of simulation-based games, ACM Transactions on Modeling and Computer Simulation, 20:3, (1-25), Online publication date: 1-Sep-2010.
- Mihailescu M and Teo Y A distributed market framework for large-scale resource sharing Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I, (418-430)
- Sui X and Leung H An adaptive bidding strategy for combinatorial auction-based resource allocation in dynamic markets Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence, (510-522)
- Robu V, Vetsikas I, Gerding E and Jennings N Addressing the Exposure Problem of Bidding Agents Using Flexibly Priced Options Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (581-586)
- Bofill M, Busquets D and Villaret M A declarative approach to robust weighted Max-SAT Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, (67-76)
- Goossens D, Müller R and Spieksma F (2010). Algorithms for Recognizing Economic Properties in Matrix Bid Combinatorial Auctions, INFORMS Journal on Computing, 22:3, (339-352), Online publication date: 1-Jul-2010.
- Roughgarden T (2010). Algorithmic game theory, Communications of the ACM, 53:7, (78-86), Online publication date: 1-Jul-2010.
- Giovannucci A, Cerquides J and Rodríguez-Aguilar J (2010). Composing supply chains through multiunit combinatorial reverse auctions with transformability relationships among goods, IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans, 40:4, (767-778), Online publication date: 1-Jul-2010.
- An B and Lesser V (2010). Characterizing contract-based multiagent resource allocation in networks, IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 40:3, (575-586), Online publication date: 1-Jun-2010.
- Van den Bossche R, Vanmechelen K and Broeckhove J An Evaluation of the Benefits of Fine-Grained Value-Based Scheduling on General Purpose Clusters Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing, (196-204)
- Vorobeychik Y and Engel Y Incentive analysis of approximately efficient allocation algorithms Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, (1479-1480)
- Krysta P, Michalak T, Sandholm T and Wooldridge M Combinatorial auctions with externalities Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, (1471-1472)
- An B, Lesser V, Irwin D and Zink M Automated negotiation with decommitment for dynamic resource allocation in cloud computing Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, (981-988)
- Iwasaki A, Conitzer V, Omori Y, Sakurai Y, Todo T, Guo M and Yokoo M Worst-case efficiency ratio in false-name-proof combinatorial auction mechanisms Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1, (633-640)
- Porello D and Endriss U Modelling combinatorial auctions in linear logic Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, (71-78)
- Giovannucci A, Cerquides J, Endriss U and Rodríguez-Aguilar J (2010). A graphical formalism for mixed multi-unit combinatorial auctions, Autonomous Agents and Multi-Agent Systems, 20:3, (342-368), Online publication date: 1-May-2010.
- Aziz H (2010). Multiagent systems, ACM SIGACT News, 41:1, (34-37), Online publication date: 1-Mar-2010.
- Conitzer V (2010). Making decisions based on the preferences of multiple agents, Communications of the ACM, 53:3, (84-94), Online publication date: 1-Mar-2010.
- Dobzinski S, Nisan N and Schapira M (2010). Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders, Mathematics of Operations Research, 35:1, (1-13), Online publication date: 1-Feb-2010.
- Buchfuhrer D, Dughmi S, Fu H, Kleinberg R, Mossel E, Papadimitriou C, Schapira M, Singer Y and Umans C Inapproximability for VCG-based combinatorial auctions Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (518-536)
- Dunne P, Kraus S, Manisterski E and Wooldridge M (2010). Solving coalitional resource games, Artificial Intelligence, 174:1, (20-50), Online publication date: 1-Jan-2010.
- Marinescu R and Dechter R (2010). Evaluating the impact of AND/OR search on 0-1 integer linear programming, Constraints, 15:1, (29-63), Online publication date: 1-Jan-2010.
- Vorobeychik Y and Wellman M Strategic analysis with simulation-based games Winter Simulation Conference, (359-372)
- Dütting P, Henzinger M and Weber I Bidder Optimal Assignments for General Utilities Proceedings of the 5th International Workshop on Internet and Network Economics, (575-582)
- Pan M, Chen F, Yin X and Fang Y Fair profit allocation in the spectrum auction using the Shapley value Proceedings of the 28th IEEE conference on Global telecommunications, (4028-4033)
- Almajano P, Cerquides J and Rodriguez-Aguilar J Empirical hardness for mixed auctions Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence, (161-170)
- Chen R, AhmadBeygi S, Cohn A, Beil D and Sinha A (2009). Solving Truckload Procurement Auctions Over an Exponential Number of Bundles, Transportation Science, 43:4, (493-510), Online publication date: 1-Nov-2009.
- Sakurai Y, Yokoo M, Iwasaki A and Suzuki K Secure Keyword Auction Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02, (419-422)
- Sui X and Leung H A q-learning based adaptive bidding strategy in combinatorial auctions Proceedings of the 11th International Conference on Electronic Commerce, (186-194)
- Lubin B, Kephart J, Das R and Parkes D Expressive power-based resource allocation for data centers Proceedings of the 21st International Joint Conference on Artificial Intelligence, (1451-1456)
- Day R and Raghavan S (2009). Matrix Bidding in Combinatorial Auctions, Operations Research, 57:4, (916-933), Online publication date: 1-Jul-2009.
- Lubin B and Parkes D Quantifying the strategyproofness of mechanisms via metrics on payoff distributions Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (349-358)
- Leyton-Brown K, Nudelman E and Shoham Y (2009). Empirical hardness models, Journal of the ACM, 56:4, (1-52), Online publication date: 1-Jun-2009.
- Mochon A, Saez Y, Isasi P and Gomez-Barroso J Testing bidding strategies in the clock-proxy auction for selling radio spectrum Proceedings of the Eleventh conference on Congress on Evolutionary Computation, (2348-2353)
- Kasbekar G and Sarkar S Spectrum auction framework for access allocation in cognitive radio networks Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing, (13-22)
- Zhao H and Li X Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, (4-11)
- Vetsikas I, Rogers A and Jennings N Pick-a-bundle Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (1225-1226)
- Sui X and Leung H An adaptive bidding strategy for combinatorial auctions-based resource allocation in dynamic markets Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (1157-1158)
- Todo T, Iwasaki A, Yokoo M and Sakurai Y Characterizing false-name-proof allocation rules in combinatorial auctions Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (265-272)
- Conitzer V (2009). Eliciting single-peaked preferences using comparison queries, Journal of Artificial Intelligence Research, 35:1, (161-191), Online publication date: 1-May-2009.
- Fukuta N and Ito T Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation Agent Computing and Multi-Agent Systems, (195-206)
- Bichler M, Shabalin P and Pikovsky A (2009). A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats, Information Systems Research, 20:1, (33-59), Online publication date: 1-Mar-2009.
- Escudero L, Landete M and Marín A (2009). A branch-and-cut algorithm for the Winner Determination Problem, Decision Support Systems, 46:3, (649-659), Online publication date: 1-Feb-2009.
- Bouveret S and Lemaître M (2009). Computing leximin-optimal solutions in constraint networks, Artificial Intelligence, 173:2, (343-364), Online publication date: 1-Feb-2009.
- Rastegari B, Condon A and Leyton-Brown K Stepwise randomized combinatorial auctions achieve revenue monotonicity Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (738-747)
- Fukuta N and Ito T (2009). Fine-grained efficient resource allocation using approximated combinatorial auctions, Web Intelligence and Agent Systems, 7:1, (43-63), Online publication date: 1-Jan-2009.
- Babaioff M, Lavi R and Pavlov E (2009). Single-value combinatorial auctions and algorithmic implementation in undominated strategies, Journal of the ACM, 56:1, (1-32), Online publication date: 1-Jan-2009.
- Feigenbaum J, Parkes D and Pennock D (2009). Computational challenges in e-commerce, Communications of the ACM, 52:1, (70-74), Online publication date: 1-Jan-2009.
- Özer A and Özturan C (2009). A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction, Computers and Operations Research, 36:1, (196-208), Online publication date: 1-Jan-2009.
- Fukuta N and Ito T Winner Price Monotonicity for Approximated Combinatorial Auctions Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03, (533-537)
- Liu Y and Mohamed Y Multi-agent resource allocation (MARA) for modeling construction processes Proceedings of the 40th Conference on Winter Simulation, (2361-2369)
- Chan J and Kroese D Randomized methods for solving the winner determination problem in combinatorial auctions Proceedings of the 40th Conference on Winter Simulation, (1344-1349)
- Balcan M, Blum A and Mansour Y (2008). Item pricing for revenue maximization, ACM SIGecom Exchanges, 7:3, (1-4), Online publication date: 1-Nov-2008.
- Kameshwaran S and Benyoucef L Optimal buying from online retailers offering total value discounts Proceedings of the 10th international conference on Electronic commerce, (1-5)
- Shoham Y (2008). Computer science and game theory, Communications of the ACM, 51:8, (74-79), Online publication date: 1-Aug-2008.
- Benisch M, Sadeh N and Sandholm T A theory of expressiveness in mechanisms Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (17-23)
- Ghodsi M, Mahini H, Mirrokni V and ZadiMoghaddam M Permutation betting markets Proceedings of the 9th ACM conference on Electronic commerce, (180-189)
- Balcan M, Blum A and Mansour Y Item pricing for revenue maximization Proceedings of the 9th ACM conference on Electronic commerce, (50-59)
- Mous L, Robu V and La Poutré H (2008). Can priced options solve the exposure problem in sequential auctions?, ACM SIGecom Exchanges, 7:2, (1-4), Online publication date: 1-Jun-2008.
- Uckelman J and Endriss U Winner determination in combinatorial auctions with logic-based bidding languages Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1617-1620)
- Sakurai Y, Saito Y, lwasaki A and Yokoo M Beyond quasi-linear utility Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1609-1612)
- Ottens B and Endriss U Comparing winner determination algorithms for mixed multi-unit combinatorial auctions Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1601-1604)
- Gradwell P, Oey M, Timmer R, Brazier F and Padget J Engineering large-scale distributed auctions Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3, (1311-1314)
- Giovannucci A, Vinyals M, Rodriguez-Aguilar J and Cerquides J Computationally-efficient winner determination for mixed multi-unit combinatorial auctions Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2, (1071-1078)
- Vorobeychik Y and Wellman M Stochastic search methods for nash equilibrium approximation in simulation-based games Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2, (1055-1062)
- Petcu A, Faltings B and Parkes D (2008). M-DPOP, Journal of Artificial Intelligence Research, 32:1, (705-755), Online publication date: 1-May-2008.
- Bouveret S and Lang J (2008). Efficiency and envy-freeness in fair division of indivisible goods, Journal of Artificial Intelligence Research, 32:1, (525-564), Online publication date: 1-May-2008.
- Feige U, Immorlica N, Mirrokni V and Nazerzadeh H A combinatorial allocation mechanism with penalties for banner advertising Proceedings of the 17th international conference on World Wide Web, (169-178)
- Golovin D (2007). More expressive market models and the future of combinatorial auctions, ACM SIGecom Exchanges, 7:1, (55-57), Online publication date: 1-Dec-2007.
- Vanmechelen K and Broeckhove J A comparative analysis of single-unit vickrey auctions and commodity markets for realizing grid economies with dynamic pricing Proceedings of the 4th international conference on Grid economics and business models, (98-111)
- Chen W and Meng J Approximation algorithms for k-duplicates combinatorial auctions with subadditive bidders Proceedings of the 1st international conference on Combinatorial optimization and applications, (163-170)
- Demir G and Gini M (2007). Winner determination for combinatorial auctions for tasks with time and precedence constraints, Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology, 18:3, (267-280), Online publication date: 1-Aug-2007.
- Fukuta N and Ito T Toward a large scale E-market Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems, (354-363)
- Fukuta N and Ito T Short-time approximation on combinatorial auctions Proceedings of the 3rd international workshop on Data enginering issues in E-commerce and services: In conjunction with ACM Conference on Electronic Commerce (EC '07), (26-33)
- Chen Y, Fortnow L, Nikolova E and Pennock D Betting on permutations Proceedings of the 8th ACM conference on Electronic commerce, (326-335)
- Golovin D Stochastic packing-market planning Proceedings of the 8th ACM conference on Electronic commerce, (172-181)
- Goradia H and Vidal J An equal excess negotiation algorithm for coalition formation Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-3)
- Giovannucci A, Rodriguez-Aguilar J, Cerquides J and Endriss U Winner determination for mixed multi-unit combinatorial auctions via petri nets Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Mendoza B and Vidal J Bidding algorithms for a distributed combinatorial auction Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Gerding E, Dash R, Yuen D and Jennings N Bidding optimally in concurrent second-price auctions of perfectly substitutable goods Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems, (1-8)
- Nisan N and Ronen A (2007). Computationally feasible VCG mechanisms, Journal of Artificial Intelligence Research, 29:1, (19-47), Online publication date: 1-May-2007.
- Chevaleyre Y, Endriss U, Lang J and Maudet N A Short Introduction to Computational Social Choice Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (51-69)
- Chen N and Karlin A Cheap labor can be expensive Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, (707-715)
- Hyafil N and Boutilier C Mechanism design with partial revelation Proceedings of the 20th international joint conference on Artifical intelligence, (1333-1340)
- Blumrosen L, Nisan N and Segal I (2007). Auctions with severely bounded communication, Journal of Artificial Intelligence Research, 28:1, (233-266), Online publication date: 1-Jan-2007.
- Fukuta N and Ito T Towards Better Approximation of Winner Determination for Combinatorial Auctions with Large Number of Bids Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology, (618-621)
- Bichler M and Kalagnanam J (2006). Software frameworks for advanced procurement auction markets, Communications of the ACM, 49:12, (104-108), Online publication date: 1-Dec-2006.
- Routzounis S and Stamoulis G An efficient mechanism for auctioning alternative paths Proceeding from the 2006 workshop on Game theory for communications and networks, (12-es)
- Hyafil N and Boutilier C Regret-based incremental partial revelation mechanisms Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (672-678)
- Babaioff M, Lavi R and Pavlov E Impersonation-based mechanisms Proceedings of the 21st national conference on Artificial intelligence - Volume 1, (592-597)
- desJardins M, Eaton E and Wagstaff K Learning user preferences for sets of objects Proceedings of the 23rd international conference on Machine learning, (273-280)
- Kameshwaran S and Benyoucef L Branch on price Proceedings of the Second international conference on Algorithmic Aspects in Information and Management, (375-386)
- Blumrosen L and Dobzinski S Welfare maximization in congestion games Proceedings of the 7th ACM conference on Electronic commerce, (52-61)
- Dobzinski S, Nisan N and Schapira M Truthful randomized mechanisms for combinatorial auctions Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (644-652)
- Giovannucci A, Cerquides J and Rodríguez-Aguilar J Savings in combinatorial auctions through transformation relationships Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets, (17-30)
- Estivie S, Chevaleyre Y, Endriss U and Maudet N How equitable is rational negotiation? Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (866-873)
- Endriss U Monotonic concession protocols for multilateral negotiation Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (392-399)
- Chevaleyre Y, Endriss U and Maudet N Tractable negotiation in tree-structured domains Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems, (362-369)
- Babaioff M, Lavi R and Pavlov E Single-value combinatorial auctions and implementation in undominated strategies Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (1054-1063)
- Endriss U, Maudet N, Sadri F and Toni F (2006). Negotiating socially optimal allocations of resources, Journal of Artificial Intelligence Research, 25:1, (315-348), Online publication date: 1-Jan-2006.
- Kameshwaran S, Benyoucef L and Xie X Winner determination in discount auctions Proceedings of the First international conference on Internet and Network Economics, (868-877)
- Chen N and Rudra A Walrasian equilibrium Proceedings of the First international conference on Internet and Network Economics, (141-150)
- Khot S, Lipton R, Markakis E and Mehta A Inapproximability results for combinatorial auctions with submodular utility functions Proceedings of the First international conference on Internet and Network Economics, (92-101)
- Kameshwaran S, Benyoucef L and Xie X Discount auctions for procuring heterogeneous items Proceedings of the 7th international conference on Electronic commerce, (244-249)
- Chevaleyre Y, Endriss U and Maudet N On maximal classes of utility functions for efficient one-to-one negotiation Proceedings of the 19th international joint conference on Artificial intelligence, (941-946)
- Bouveret S, Lemaître M, Fargier H and Lang J Allocation of indivisible goods Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (1309-1310)
- Chevaleyre Y, Endriss U, Lang J and Maudet N Negotiating over small bundles of resources Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems, (296-302)
- Schvartzman L and Wellman M Market-based allocation with indivisible bids Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms, (57-70)
- DesJardins M and Wagstaff K DD-PREF Proceedings of the 20th national conference on Artificial intelligence - Volume 2, (620-626)
- Dobzinski S, Nisan N and Schapira M Approximation algorithms for combinatorial auctions with complement-free bidders Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, (610-618)
- Brandt F and Sandholm T Efficient privacy-preserving protocols for multi-unit auctions Proceedings of the 9th international conference on Financial Cryptography and Data Security, (298-312)
Index Terms
- Combinatorial Auctions
Recommendations
Competing Combinatorial Auctions
Combinatorial auctions are auctions in which bids can be submitted on sets of items, rather than just on individual items. These auctions are generally beneficial to both auctioneers and bidders, as they allow bidders to express their synergies for sets ...
We investigate whether revenue-maximizing auctioneers selling heterogeneous items will allow for combinatorial bidding in the presence of auctioneer competition. We compare the choice of auction format by two competing auctioneers with that of a single ...
Combinatorial Auctions with Endowment Effect
EC '18: Proceedings of the 2018 ACM Conference on Economics and ComputationWe study combinatorial auctions with bidders that exhibit endowment effect. In most of the previous work on cognitive biases in algorithmic game theory (e.g., [Kleinberg and Oren, EC'14] and its follow-ups) the focus was on analyzing the implications ...
Bayesian Combinatorial Auctions
We study the following simple Bayesian auction setting: m items are sold to n selfish bidders in m independent second-price auctions. Each bidder has a private valuation function that specifies his or her complex preferences over all subsets of items. ...