Search Results for author:
Found 4 papers, 1 papers with code
Understanding Iterative Combinatorial Auction Designs via Multi-Agent Reinforcement Learning
Iterative combinatorial auctions are widely used in high stakes settings such as spectrum auctions.
Matching Papers and Reviewers at Large Conferences
Peer-reviewed conferences, the main publication venues in CS, rely critically on matching highly qualified reviewers for each paper.
Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates
The value of a match is determined by the types of the matched agents.
Computer Science and Game Theory Data Structures and Algorithms
Deep Optimization for Spectrum Repacking
A crucial element of the auction design was the construction of a solver, dubbed SATFC, that determined whether sets of stations could be "repacked" in this way; it needed to run every time a station was given a price quote.
