7 citations · 12 across the 22 of their papers we have counts for
34 papers
Tight Approximation Results for Matroid Optimization with a Linear Constraint
Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler
We study the following class of matroid optimization problems with a linear constraint (P-MOL). Given a matroid M=(E,I), two weight functions , and a threshold…
Online Contract Design
Elad Lavi, Hadas Shachnai, Inbal Talgam-Cohen
We initiate the study of online contracts, which integrate the game-theoretic considerations of economic contract theory, with the algorithmic and informational challenges of onlin…
An Algorithm-to-Contract Framework without Demand Queries
Ilan Doron-Arad, Hadas Shachnai, Gilad Shmerler +1
Consider costly and time-consuming tasks that add up to the success of a project, and must be fitted into a given time-frame. This is an instance of the classic budgeted maximizati…
Finding Possible Winners in Spatial Voting with Incomplete Information
Hadas Shachnai, Rotem Shavitt, Andreas Wiese
We consider a spatial voting model where both candidates and voters are positioned in the -dimensional Euclidean space, and each voter ranks candidates based on their proximity…
You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai
The -matroid intersection (-MI) problem asks if given matroids share a common basis. Already for , notable canonical NP-complete special cases are -…
Approximations and Hardness of Packing Partially Ordered Items
Ilan Doron-Arad, Guy Kortsarz, Joseph Naor +2
Motivated by applications in production planning and storage allocation in hierarchical databases, we initiate the study of covering partially ordered items (CPO). Given a capacity…