activity
20122026
most citedReducing the rank of a matroid

13 citations · 66 across the 39 of their papers we have counts for

collaborators
Showing 2021Show all

6 papers · 1 filter

cs.GT2021

Risk-Free Bidding in Complement-Free Combinatorial Auctions

Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta

We study risk-free bidding strategies in combinatorial auctions with incomplete information. Specifically, what is the maximum profit that a complement-free (subadditive) bidder ca…

cs.GT2021

An Improved Bound for the Tree Conjecture in Network Creation Games

Jack Dippel, Adrian Vetta

We study Nash equilibria in the network creation game of Fabrikant et al.[10]. In this game a vertex can buy an edge to another vertex for a cost of , and the objective of each…

cs.GT2021

Two Birds With One Stone: Fairness and Welfare via Transfers

Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta

We study the question of dividing a collection of indivisible goods amongst a set of agents. The main objective of research in the area is to achieve one of two goals: fairness or…

cs.GT2021

Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees

Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta

Liquid democracy has a natural graphical representation, the delegation graph. Consequently, the strategic aspects of liquid democracy can be studied as a game over delegation grap…

econ.TH2021

A Recursive Measure of Voting Power that Satisfies Reasonable Postulates

Arash Abizadeh, Adrian Vetta

We design a recursive measure of voting power based on partial as well as full voting efficacy. Classical measures, by contrast, incorporate solely full efficacy. We motivate our d…

cs.GT2021

Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming

Mete Şeref Ahunbay, Adrian Vetta

We study the performance of the Empirical Revenue Maximizing (ERM) mechanism in a single-item, single-seller, single-buyer setting. We assume the buyer's valuation is drawn from a…