44 citations · 80 across the 32 of their papers we have counts for
Showing 2024 · cs.GTShow all
2 papers · 2 filters
cs.GT2024
Linear Contracts for Supermodular Functions Based on Graphs
Kanstantsin Pashkovich, Jacob Skitsko
We study linear contracts for combinatorial problems in multi-agent settings. In this problem, a principal designs a linear contract with several agents, each of whom can decide to…
cs.GT2024
Matroid Bayesian Online Selection
Ian DeHaan, Kanstantsin Pashkovich
We study a class of Bayesian online selection problems with matroid constraints. Consider a vendor who has several items to sell, with the set of sold items being subject to some s…