31 citations · 144 across the 37 of their papers we have counts for
5 papers · 1 filter
Groupwise Maximin Fair Allocation of Indivisible Goods
Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy +1
We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fair…
Formation of Stable Strategic Networks with Desired Topologies
Swapnil Dhamal, Y. Narahari
Many real-world networks such as social networks consist of strategic agents. The topology of these networks often plays a crucial role in determining the ease and speed with which…
Information Diffusion in Social Networks in Two Phases
Swapnil Dhamal, Prabuchandran K. J., Y. Narahari
The problem of maximizing information diffusion, given a certain budget expressed in terms of the number of seed nodes, is an important topic in social networks research. Existing…
On Optimal Mechanisms in the Two-Item Single-Buyer Unit-Demand Setting
D. Thirumulanathan, Rajesh Sundaresan, Y Narahari
We consider the problem of designing a revenue-optimal mechanism in the two-item, single-buyer, unit-demand setting when the buyer's valuations, , are uniformly distrib…
A Dominant Strategy Truthful, Deterministic Multi-Armed Bandit Mechanism with Logarithmic Regret
Divya Padmanabhan, Satyanath Bhat, Prabuchandran K. J. +2
Stochastic multi-armed bandit (MAB) mechanisms are widely used in sponsored search auctions, crowdsourcing, online procurement, etc. Existing stochastic MAB mechanisms with a deter…