12 citations · 20 across the 10 of their papers we have counts for
13 papers
Knowing Who, Not How Much: Learning-Augmented Mechanisms for Consumer Utility Maximization
Kira Goldner, Divyarthi Mohan, Thodoris Tsilivis
We study consumer utility maximization in an online random-order model where strategic agents arrive sequentially. To circumvent strong impossibility results for utility maximizati…
Online Combinatorial Allocation with Interdependent Values
Michal Feldman, Simon Mauras, Divyarthi Mohan +1
We study online combinatorial allocation problems in the secretary setting, under interdependent values. In the interdependent model, introduced by Milgrom and Weber (1982), each a…
A note on multiplicative-inverse chaining in finite fields
Divyarthi Mohan, R. Ravindraraj
We consider chaining multiplicative-inverse operations in finite fields under alternating polynomial bases. When using two distinct polynomial bases to alternate the inverse operat…
Mechanism Design via the Interim Relaxation
Kshipra Bhawalkar, Marios Mertzanidis, Divyarthi Mohan +1
We study revenue maximization for agents with additive preferences, subject to downward-closed constraints on the set of feasible allocations. In seminal work, Alaei~\cite{alaei201…
Optimal Stopping with Interdependent Values
Simon Mauras, Divyarthi Mohan, Rebecca Reiffenhäuser
We study online selection problems in both the prophet and secretary settings, when arriving agents have interdependent values. In the interdependent values model, introduced in th…
Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
Alon Eden, Michal Feldman, Simon Mauras +1
We study auction design within the widely acclaimed model of interdependent values, introduced by Milgrom and Weber [1982]. In this model, every bidder has a private signal $s_…
Constant Approximation for Private Interdependent Valuations
Alon Eden, Michal Feldman, Kira Goldner +2
The celebrated model of auctions with interdependent valuations, introduced by Milgrom and Weber in 1982, has been studied almost exclusively under private signals $s_1, \ldots, s_…
Asynchronous Majority Dynamics on Binomial Random Graphs
Divyarthi Mohan, Pawel Pralat
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "corr…
Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions
Gagan Aggarwal, Kshipra Bhawalkar, Aranyak Mehta +2
Internet ad auctions have evolved from a few lines of text to richer informational layouts that include images, sitelinks, videos, etc. Ads in these new formats occupy varying amou…
Communicating with Anecdotes
Nika Haghtalab, Nicole Immorlica, Brendan Lucier +2
We study a communication game between a sender and a receiver. The sender chooses one of her signals about the state of the world (i.e., anecdotes) and communicates to the receiver…
Interdependent Public Projects
Avi Cohen, Michal Feldman, Divyarthi Mohan +1
In the interdependent values (IDV) model introduced by Milgrom and Weber [1982], agents have private signals that capture their information about different social alternatives, and…
Asynchronous Majority Dynamics in Preferential Attachment Trees
Maryam Bahrani, Nicole Immorlica, Divyarthi Mohan +1
We study information aggregation in networks where agents make binary decisions (labeled incorrect or correct). Agents initially form independent private beliefs about the better d…
Approximation Schemes for a Unit-Demand Buyer with Independent Items via Symmetries
Pravesh Kothari, Divyarthi Mohan, Ariel Schvartzman +2
We consider a revenue-maximizing seller with items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distin…