output
20102025
most citedDeepSTORM3D: dense three dimensional localization microscopy and point spread function design by deep learning

332 citations

Showing cs.GTShow all

7 papers · 1 filter

cs.GT2024

Learning in Budgeted Auctions with Spacing Objectives

Giannis Fikioris, Robert Kleinberg, Yoav Kolumbus +3

In many repeated auction settings, participants care not only about how frequently they win but also how their winnings are distributed over time. This problem arises in various pr…

cs.GT2024

Reducing Leximin Fairness to Utilitarian Optimization

Eden Hartman, Yonatan Aumann, Avinatan Hassidim +1

Two prominent objectives in social choice are utilitarian - maximizing the sum of agents' utilities, and leximin - maximizing the smallest agent's utility, then the second-smallest…

cs.GT2018★ 9 cited

Optimal Algorithm for Bayesian Incentive-Compatible Exploration

Lee Cohen, Yishay Mansour

We consider a social planner faced with a stream of myopic selfish agents. The goal of the social planner is to maximize the social welfare, however, it is limited to using only in…

cs.GT2011

Non-Price Equilibria in Markets of Discrete Goods

Avinatan Hassidim, Haim Kaplan, Yishay Mansour +1

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of…

cs.GT2010

Matching with Couples Revisited

Itai Ashlagi, Mark Braverman, Avinatan Hassidim

It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a gen…

cs.GT2010★ 5 cited

Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions

Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha +2

We design algorithms for computing approximately revenue-maximizing {\em sequential posted-pricing mechanisms (SPM)} in -unit auctions, in a standard Bayesian model. A seller ha…