Michal Feldman

research

∙ 09/19/2023

Combinatorial Contracts Beyond Gross Substitutes

We study the combinatorial contracting problem of Dütting et al. [FOCS '...

0 Paul Dütting, et al. ∙

research

∙ 07/14/2023

Optimal Metric Distortion with Predictions

In the metric distortion problem there is a set of candidates and a set ...

0 Ben Berger, et al. ∙

research

∙ 04/07/2023

Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations

We study best-of-both-worlds guarantees for the fair division of indivis...

0 Michal Feldman, et al. ∙

research

∙ 03/02/2023

Pandora's Problem with Combinatorial Cost

Pandora's problem is a fundamental model in economics that studies optim...

0 Ben Berger, et al. ∙

research

∙ 02/19/2023

On Optimal Tradeoffs between EFX and Nash Welfare

A major problem in fair division is how to allocate a set of indivisible...

0 Michal Feldman, et al. ∙

research

∙ 02/15/2023

Ambiguous Contracts

In this paper we initiate the study of ambiguous contracts, capturing ma...

0 Paul Dütting, et al. ∙

research

∙ 11/10/2022

Multi-Agent Contracts

We study a natural combinatorial single-principal multi-agent contract d...

0 Paul Duetting, et al. ∙

research

∙ 11/03/2022

Truthful Matching with Online Items and Offline Agents

We study truthful mechanisms for welfare maximization in online bipartit...

0 Michal Feldman, et al. ∙

research

∙ 09/26/2022

Lookahead Auctions with Pooling

A Lookahead Auction (LA), introduced by Ronen, is an auction format for ...

0 Almog Wald, et al. ∙

research

∙ 04/17/2022

Interdependent Public Projects

In the interdependent values (IDV) model introduced by Milgrom and Weber...

0 Avi Cohen, et al. ∙

research

∙ 02/18/2022

Bayesian and Randomized Clock Auctions

In a single-parameter mechanism design problem, a provider is looking to...

0 Michal Feldman, et al. ∙

research

∙ 02/18/2022

On the Significance of Knowing the Arrival Order in Prophet Inequality

In a prophet inequality problem, n boxes arrive online, each containing ...

0 Tomer Ezra, et al. ∙

research

∙ 12/15/2021

Two-Price Equilibrium

Walrasian equilibrium is a prominent market equilibrium notion, but rare...

0 Michal Feldman, et al. ∙

research

∙ 09/29/2021

Combinatorial Contracts

We introduce a new model of combinatorial contracts in which a principal...

0 Paul Duetting, et al. ∙

research

∙ 07/01/2021

Prophet Inequality with Competing Agents

We introduce a model of competing agents in a prophet setting, where rew...

0 Tomer Ezra, et al. ∙

research

∙ 03/15/2021

Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations

We consider a market setting of agents with additive valuations over het...

0 Nir Andelman, et al. ∙

research

∙ 02/26/2021

Are Gross Substitutes a Substitute for Submodular Valuations?

The class of gross substitutes (GS) set functions plays a central role i...

0 Shahar Dozinski, et al. ∙

research

∙ 02/21/2021

(Almost Full) EFX Exists for Four Agents (and Beyond)

The existence of EFX allocations is a major open problem in fair divisio...

0 Ben Berger, et al. ∙

research

∙ 11/03/2020

Secretary Matching with General Arrivals

We provide online algorithms for secretary matching in general weighted ...

0 Tomer Ezra, et al. ∙

research

∙ 11/01/2020

Price of Anarchy of Simple Auctions with Interdependent Values

We expand the literature on the price of anarchy (PoA) of simultaneous i...

0 Alon Eden, et al. ∙

research

∙ 10/14/2020

On Fair Division under Heterogeneous Matroid Constraints

We study fair allocation of indivisible goods among additive agents with...

0 Amitay Dror, et al. ∙

research

∙ 07/14/2020

On a Competitive Secretary Problem with Deferred Selections

We study secretary problems in settings with multiple agents. In the sta...

0 Tomer Ezra, et al. ∙

research

∙ 03/26/2020

Simultaneous 2nd Price Item Auctions with No-Underbidding

We study the price of anarchy (PoA) of simultaneous 2nd price auctions (...

0 Michal Feldman, et al. ∙

research

∙ 03/12/2020

Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer

A single seller wishes to sell n items to a single unit-demand buyer. We...

0 Moshe Babaioff, et al. ∙

research

∙ 02/26/2020

The Efficiency of Best-Response Dynamics

Best response (BR) dynamics is a natural method by which players proceed...

0 Michal Feldman, et al. ∙

research

∙ 02/23/2020

Online Stochastic Max-Weight Matching: prophet inequality for vertex and edge arrival models

We provide prophet inequality algorithms for online weighted matching in...

0 Tomer Ezra, et al. ∙

research

∙ 02/17/2020

On the Power and Limits of Dynamic Pricing in Combinatorial Markets

We study the power and limits of optimal dynamic pricing in combinatoria...

0 Ben Berger, et al. ∙

research

∙ 03/27/2019

A General Framework for Endowment Effects in Combinatorial Markets

The endowment effect, coined by Nobel Laureate Richard Thaler, posits th...

0 Tomer Ezra, et al. ∙

research

∙ 03/20/2019

Combinatorial Auctions with Interdependent Valuations: SOS to the Rescue

We study combinatorial auctions with interdependent valuations. In such ...

0 Alon Eden, et al. ∙

research

∙ 11/24/2018

Complement-Free Couples Must Communicate: A Hardness Result for Two-Player Combinatorial Auctions

We study the communication complexity of welfare maximization in combina...

0 Tomer Ezra, et al. ∙

research

∙ 06/11/2018

Interdependent Values without Single-Crossing

We consider a setting where an auctioneer sells a single item to n poten...

0 Alon Eden, et al. ∙

research

∙ 05/14/2018

Prophets and Secretaries with Overbooking

The prophet and secretary problems demonstrate online scenarios involvin...

0 Tomer Ezra, et al. ∙

research

∙ 04/18/2018

An Economic-Based Analysis of RANKING for Online Bipartite Matching

We give a simple proof showing that the RANKING algorithm introduced by ...

0 Alon Eden, et al. ∙

research

∙ 04/09/2018

Prompt Scheduling for Selfish Agents

We give a prompt online mechanism for minimizing the sum of [weighted] c...

0 Alon Eden, et al. ∙

research

∙ 03/14/2018

Max-Min Greedy Matching

A bipartite graph G(U,V;E) that admits a perfect matching is given. One ...

0 Alon Eden, et al. ∙

research

∙ 01/09/2018

99% Revenue via Enhanced Competition

A sequence of recent studies show that even in the simple setting of a s...

0 Michal Feldman, et al. ∙

research

∙ 12/18/2015

On Voting and Facility Location

We study mechanisms for candidate selection that seek to minimize the so...

0 Michal Feldman, et al. ∙

research

∙ 02/14/2012

Solving Cooperative Reliability Games

Cooperative games model the allocation of profit from joint actions, fol...

0 Yoram Bachrach, et al. ∙

Michal Feldman

Featured Co-authors