1 citations · 3 across the 19 of their papers we have counts for
9 papers · 1 filter
Revisiting the Bertrand Paradox via Equilibrium Analysis of No-regret Learners
Arnab Maiti, Junyan Liu, Kevin Jamieson +1
We study the discrete Bertrand pricing game with a non-increasing demand function. The game has players who simultaneously choose prices from the set $\{1/k, 2/k, \ldots,…
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals
Junyan Liu, Arnab Maiti, Artin Tajdini +2
We initiate the study of a repeated principal-agent problem over a finite horizon , where a principal sequentially interacts with types of agents arriving in an advers…
Query-Efficient Algorithm to Find all Nash Equilibria in a Two-Player Zero-Sum Matrix Game
Arnab Maiti, Ross Boczar, Kevin Jamieson +1
We study the query complexity of finding the set of all Nash equilibria in two-player zero-sum matrix games. Fearnley and Savani (2016) s…
Instance-dependent Sample Complexity Bounds for Zero-sum Matrix Games
Arnab Maiti, Kevin Jamieson, Lillian J. Ratliff
We study the sample complexity of identifying an approximate equilibrium for two-player zero-sum matrix games. That is, in a sequence of repeated game plays, how many r…
On Binary Networked Public Goods Game with Altruism
Arnab Maiti, Palash Dey
In the classical Binary Networked Public Goods (BNPG) game, a player can either invest in a public project or decide not to invest. Based on the decisions of all the players, each…
Parameterized Algorithms for Kidney Exchange
Arnab Maiti, Palash Dey
In kidney exchange programs, multiple patient-donor pairs each of whom are otherwise incompatible, exchange their donors to receive compatible kidneys. The Kidney Exchange problem…
Universal and Tight Online Algorithms for Generalized-Mean Welfare
Siddharth Barman, Arindam Khan, Arnab Maiti
We study fair and efficient allocation of divisible goods, in an online manner, among agents. The goods arrive online in a sequence of time periods. The agents' values for…
On Parameterized Complexity of Binary Networked Public Goods Game
Arnab Maiti, Palash Dey
In the Binary Networked Public Goods game, every player needs to decide if she participates in a public project whose utility is shared equally by the community. We study the probl…
On Parameterized Complexity of Liquid Democracy
Palash Dey, Arnab Maiti, Amatya Sharma
In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who event…