Optimizing resource allocation: an active learning approach to iterative combinatorial auctions

DOI10.1016/J.TCS.2025.115104MaRDI QIDQ7021841zbMATH OpenFDO

Authors Benjamin Estermann, Stefan Kramer, Roger Wattenhofer, Kanye Ye Wang

Publication date 26 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115104

zbMATH Keywords

active learningcombinatorial auctionsdeep learning

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• Active learning
• Hierarchical package bidding: a paper \& pencil combinatorial auction
• scientific article; zbMATH DE number 1149423 (Why is no real title available?)
• On the complexity of integer programming
• Pool-based active learning in approximate linear regression
• Preference elicitation and query learning

This page was built for publication: Optimizing resource allocation: an active learning approach to iterative combinatorial auctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021841)