Adrian Vetta

141 papers A* 20A 4B 18Journal 81Unranked 17
YearRankTypeTitle / Venue / Authors
2026 J jnl
Cities at Play: Improving Equilibria in Urban Neighbourhood Games.
CoRR
Martin Gairing, Adrian Vetta, Zhanzhan Zhao
2026 J jnl
The Condorcet dimension of metric spaces.
Oper. Res. Lett.
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
2025 J jnl
A Direct Proof of the Short-Side Advantage in Random Matching Markets.
CoRR
Simon Mauras, Pawel Pralat, Adrian Vetta
2025 J jnl
A direct proof of the short-side advantage in random matching markets.
Games Econ. Behav.
Simon Mauras, Pawel Pralat, Adrian Vetta
2025 A* conf
Eliminating Majority Illusion Is Easy.
AAAI
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2025 J jnl
Finding a Nash equilibrium of a random win-lose game in expected polynomial time.
CoRR
Andrea Collevecchio, Gabor Lugosi, Adrian Vetta, Rui-Ray Zhang
2025 A* conf
Six Candidates Suffice to Win a Voter Majority.
STOC
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang
2025 J jnl
The Popular Dimension of Matchings.
CoRR
Frank Connor, Louis-Roy Langevin, Ndiamé Ndiaye, Agnes Totschnig, Rohit Vasishta, Adrian Vetta
2025 A* conf
k-Leaf Powers Cannot Be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.
ICALP
Max Dupré la Tour, Manuel Lafond, Ndiamé Ndiaye, Adrian Vetta
2024 J jnl
A recursive measure of voting power that satisfies reasonable postulates.
Games Econ. Behav.
Arash Abizadeh, Adrian Vetta
2024 J jnl
Eliminating Majority Illusion is Easy.
CoRR
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2024 J jnl
FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares.
CoRR
Klaus Jansen, Alexandra Lassota, Malte Tutas, Adrian Vetta
2024 A conf
Gerrymandering Planar Graphs.
AAMAS
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2024 B conf
Matrix Rationalization via Partial Orders.
SAGT
Agnes Totschnig, Rohit Vasishta, Adrian Vetta
2024 J jnl
Matrix Rationalization via Partial Orders.
CoRR
Agnes Totschnig, Rohit Vasishta, Adrian Vetta
2024 A conf
One n Remains to Settle the Tree Conjecture.
STACS
Jack Dippel, Adrian Vetta
2024 A* conf
Robot Positioning Using Torus Packing for Multisets.
ICALP
Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta
2024 J jnl
Robot Positioning Using Torus Packing for Multisets.
CoRR
Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu, Adrian Vetta
2024 J jnl
Six Candidates Suffice to Win a Voter Majority.
CoRR
Moses Charikar, Alexandra Lassota, Prasanna Ramakrishnan, Adrian Vetta, Kangning Wang
2024 J jnl
The Condorcet Dimension of Metric Spaces.
CoRR
Alexandra Lassota, Adrian Vetta, Bernhard von Stengel
2023 B conf
Fair Algorithm Design: Fair and Efficacious Machine Scheduling.
SAGT
April Niu, Agnes Totschnig, Adrian Vetta
2023 J jnl
Gerrymandering Planar Graphs.
CoRR
Jack Dippel, Max Dupré la Tour, April Niu, Sanjukta Roy, Adrian Vetta
2023 J jnl
One n Remains to Settle the Tree Conjecture.
CoRR
Jack Dippel, Adrian Vetta
2023 — conf
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs.
WINE
Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta
2023 J jnl
Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs.
CoRR
Margarida Carvalho, Alison Caulfield, Yi Lin, Adrian Vetta
2023 J jnl
The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents.
CoRR
Sissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu
2023 — conf
The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems.
WINE
Sissi Jiang, Ndiamé Ndiaye, Adrian Vetta, Eggie Wu
2023 J jnl
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions.
ACM Trans. Economics and Comput.
Mete Seref Ahunbay, Adrian Vetta
2023 J jnl
The blocker postulates for measures of voting power.
Soc. Choice Welf.
Arash Abizadeh, Adrian Vetta
2022 J jnl
A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited.
CoRR
Arash Abizadeh, Adrian Vetta
2022 B conf
An Improved Bound for the Tree Conjecture in Network Creation Games.
SAGT
Jack Dippel, Adrian Vetta
2022 J jnl
Fair Algorithm Design: Fair and Efficacious Machine Scheduling.
CoRR
April Niu, Agnes Totschnig, Adrian Vetta
2022 J jnl
Risk-Free Bidding in Complement-Free Combinatorial Auctions.
Theory Comput. Syst.
Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta
2022 J jnl
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is).
Theory Comput. Syst.
Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta
2021 — conf
A Case Study in Learning in Metagames: Super Smash Bros. Melee.
AIIDE
Julien Codsi, Adrian Vetta
2021 J jnl
A Recursive Measure of Voting Power that Satisfies Reasonable Postulates.
CoRR
Arash Abizadeh, Adrian Vetta
2021 J jnl
An Improved Bound for the Tree Conjecture in Network Creation Games.
CoRR
Jack Dippel, Adrian Vetta
2021 B conf
Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
SAGT
Ndiamé Ndiaye, Sergey Norin, Adrian Vetta
2021 B conf
Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming.
SAGT
Mete Seref Ahunbay, Adrian Vetta
2021 J jnl
Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming.
CoRR
Mete Seref Ahunbay, Adrian Vetta
2021 B conf
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.
SAGT
Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta
2021 J jnl
Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.
CoRR
Jonathan A. Noel, Mashbat Suzuki, Adrian Vetta
2021 J jnl
Risk-Free Bidding in Complement-Free Combinatorial Auctions.
CoRR
Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta
2021 J jnl
The Fair Division of Hereditary Set Systems.
ACM Trans. Economics and Comput.
Zhentao Li, Adrian Vetta
2021 B conf
The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions.
SAGT
Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta
2021 J jnl
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.
Discret. Optim.
Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta
2021 J jnl
Two Birds With One Stone: Fairness and Welfare via Transfers.
CoRR
Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta
2021 B conf
Two Birds with One Stone: Fairness and Welfare via Transfers.
SAGT
Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta
2020 B conf
How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces.
SAGT
Mashbat Suzuki, Adrian Vetta
2020 J jnl
How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces.
CoRR
Mashbat Suzuki, Adrian Vetta
2020 A* conf
One Dollar Each Eliminates Envy.
EC
Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta
2020 — conf
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions.
WINE
Mete Seref Ahunbay, Adrian Vetta
2020 J jnl
The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions.
CoRR
Mete Seref Ahunbay, Adrian Vetta
2020 B conf
Two-Buyer Sequential Multiunit Auctions with No Overbidding.
SAGT
Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta
2020 J jnl
Two-Buyer Sequential Multiunit Auctions with No Overbidding.
CoRR
Mete Seref Ahunbay, Brendan Lucier, Adrian Vetta
2019 J jnl
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem.
ACM Trans. Algorithms
Christoph Hunkenschröder, Santosh S. Vempala, Adrian Vetta
2019 J jnl
Computation in Causal Graphs.
J. Graph Algorithms Appl.
Juli Atherton, Derek Ruths, Adrian Vetta
2019 J jnl
One Dollar Each Eliminates Envy.
CoRR
Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta
2019 J jnl
Pricing policies for selling indivisible storable goods to strategic consumers.
Ann. Oper. Res.
Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta
2019 B conf
Risk-Free Bidding in Complement-Free Combinatorial Auctions.
SAGT
Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta
2019 B conf
The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is).
SAGT
Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta
2019 J jnl
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is).
CoRR
Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta
2018 A* conf
The Combinatorial Clock Auction: the Effects of Strategic Behaviour and the Price Increment Rule on Social Welfare.
EC
Max Dupré la Tour, Adrian Vetta
2018 — conf
The Fair Division of Hereditary Set Systems.
WINE
Zhentao Li, Adrian Vetta
2018 J jnl
The Fair Division of Hereditary Set Systems.
CoRR
Zhentao Li, Adrian Vetta
2018 B conf
Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.
SAGT
Gerardo Berbeglia, Shant Boodaghians, Adrian Vetta
2016 A* conf
On the Economic Efficiency of the Combinatorial Clock Auction.
SODA
Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta
2016 — ed.
Web and Internet Economics - 12th International Conference, WINE 2016, Montreal, Canada, December 11-14, 2016, Proceedings
WINE
Yang Cai, Adrian Vetta
2015 A* conf
Coalition Games on Interaction Graphs: A Horticultural Perspective.
EC
Nicolas Bousquet, Zhentao Li, Adrian Vetta
2015 J jnl
Coalition Games on Interaction Graphs: A Horticultural Perspective.
CoRR
Nicolas Bousquet, Zhentao Li, Adrian Vetta
2015 — conf
Large Supports are Required for Well-Supported Nash Equilibria.
APPROX-RANDOM
Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
2015 J jnl
Large Supports are required for Well-Supported Nash Equilibria.
CoRR
Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu
2015 J jnl
On the Economic Efficiency of the Combinatorial Clock Auction.
CoRR
Nicolas Bousquet, Yang Cai, Christoph Hunkenschröder, Adrian Vetta
2015 A* conf
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.
FOCS
F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
2015 J jnl
Reducing the rank of a matroid.
Discret. Math. Theor. Comput. Sci.
Gwenaël Joret, Adrian Vetta
2015 — conf
Testing Consumer Rationality Using Perfect Graphs and Oriented Discs.
WINE
Shant Boodaghians, Adrian Vetta
2015 J jnl
Testing Consumer Rationality using Perfect Graphs and Oriented Discs.
CoRR
Shant Boodaghians, Adrian Vetta
2015 B conf
The Combinatorial World (of Auctions) According to GARP.
SAGT
Shant Boodaghians, Adrian Vetta
2015 J jnl
The Combinatorial World (of Auctions) According to GARP.
CoRR
Shant Boodaghians, Adrian Vetta
2015 J jnl
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems.
CoRR
F. Bruce Shepherd, Adrian Vetta
2015 J jnl
The Storable Good Monopoly Problem with Indivisible Demand.
CoRR
Gerardo Berbeglia, Gautam Rayaprolu, Adrian Vetta
2015 — conf
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.
WINE
Nicolas Bousquet, Yang Cai, Adrian Vetta
2015 J jnl
Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.
CoRR
Nicolas Bousquet, Yang Cai, Adrian Vetta
2014 — conf
A Near-Optimal Mechanism for Impartial Selection.
WINE
Nicolas Bousquet, Sergey Norin, Adrian Vetta
2014 J jnl
A Near-Optimal Mechanism for Impartial Selection.
CoRR
Nicolas Bousquet, Sergey Norin, Adrian Vetta
2014 J jnl
Approximating Rooted Steiner Networks.
ACM Trans. Algorithms
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
2014 — conf
Bounds on the Profitability of a Durable Good Monopolist.
WINE
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2014 J jnl
Bounds on the Profitability of a Durable Good Monopolist.
CoRR
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2014 A* conf
False-Name Bidding and Economic Efficiency in Combinatorial Auctions.
AAAI
Colleen Alkalay-Houlihan, Adrian Vetta
2014 J jnl
Pricing mechanisms for a durable good monopolist.
SIGMETRICS Perform. Evaluation Rev.
Gerardo Berbeglia, Peter Sloan, Adrian Vetta
2014 J jnl
Routing Regardless of Network Stability.
Algorithmica
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
2014 J jnl
The Complexity of the Simultaneous Cluster Problem.
J. Graph Algorithms Appl.
Zhentao Li, Manikandan Narayanan, Adrian Vetta
2014 — conf
To Save Or Not To Save: The Fisher Game.
WINE
Ruta Mehta, Nithum Thain, László A. Végh, Adrian Vetta
2013 — conf
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.
WINE
Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta
2013 J jnl
Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria below 2/3.
CoRR
Yogesh Anbalagan, Sergey Norin, Rahul Savani, Adrian Vetta
2012 B conf
A Theoretical Examination of Practical Game Playing: Lookahead Search.
SAGT
Vahab S. Mirrokni, Nithum Thain, Adrian Vetta
2012 A* conf
Approximating rooted Steiner networks.
SODA
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
2012 A conf
Clique Cover on Sparse Networks.
ALENEX
Mathieu Blanchette, Ethan Kim, Adrian Vetta
2012 — conf
Non-redistributive Second Welfare Theorems.
WINE
Bundit Laekhanukit, Guyslain Naves, Adrian Vetta
2012 J jnl
On the Implications of Lookahead Search in Game Playing
CoRR
Vahab S. Mirrokni, Nithum Thain, Adrian Vetta
2012 J jnl
Reducing the rank of a matroid
CoRR
Gwenaël Joret, Adrian Vetta
2012 J jnl
Routing Regardless of Network Stability
CoRR
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
2012 A conf
Routing Regardless of Network Stability.
ESA
Bundit Laekhanukit, Adrian Vetta, Gordon T. Wilfong
2010 J jnl
An approximation algorithm for the maximum leaf spanning arborescence problem.
ACM Trans. Algorithms
Matthew Drescher, Adrian Vetta
2010 J jnl
Bounds on the cleaning times of robot vacuums.
Oper. Res. Lett.
Zhentao Li, Adrian Vetta
2010 J jnl
Galaxy cutsets in graphs.
J. Comb. Optim.
Nicolas Sonnerat, Adrian Vetta
2010 — conf
Maximum Flows on Disjoint Paths.
APPROX-RANDOM
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
2010 B conf
On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms.
SAGT
Volodymyr Kuleshov, Adrian Vetta
2010 J jnl
Predicting direct protein interactions from affinity purification mass spectrometry data.
Algorithms Mol. Biol.
Ethan Kim, Ashish Sabharwal, Adrian Vetta, Mathieu Blanchette
2010 J jnl
Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets.
PLoS Comput. Biol.
Manikandan Narayanan, Adrian Vetta, Eric E. Schadt, Jun Zhu
2009 — conf
Computational Aspects of Multimarket Price Wars.
WINE
Nithum Thain, Adrian Vetta
2009 J jnl
Defending Planar Graphs against Star-Cutsets.
Electron. Notes Discret. Math.
Nicolas Sonnerat, Adrian Vetta
2009 J jnl
On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory B
Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour, Adrian Vetta
2008 J jnl
A Priority-Based Model of Routing.
Chic. J. Theor. Comput. Sci.
Babak Farzad, Neil Olver, Adrian Vetta
2008 J jnl
Planar graph bipartization in linear time.
Discret. Appl. Math.
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2007 J jnl
(Almost) Tight bounds and existence theorems for single-commodity confluent flows.
J. ACM
Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
2007 J jnl
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.
J. Graph Algorithms Appl.
Louigi Addario-Berry, Neil Olver, Adrian Vetta
2007 J jnl
An upper bound for the chromatic number of line graphs.
Eur. J. Comb.
Andrew D. King, Bruce A. Reed, Adrian Vetta
2007 J jnl
Approximate min-max relations for odd cycles in planar graphs.
Math. Program.
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2007 J jnl
Approximation Algorithms for Network Design with Metric Costs.
SIAM J. Discret. Math.
Joseph Cheriyan, Adrian Vetta
2007 A* conf
Degree-constrained network flows.
STOC
Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
2007 J jnl
Nash equilibria in random games.
Random Struct. Algorithms
Imre Bárány, Santosh S. Vempala, Adrian Vetta
2007 J jnl
The Demand-Matching Problem.
Math. Oper. Res.
F. Bruce Shepherd, Adrian Vetta
2006 J jnl
Network Design Via Iterative Rounding Of Setpair Relaxations.
Comb.
Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta
2005 B conf
Approximate Min-max Relations for Odd Cycles in Planar Graphs.
IPCO
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2005 A* conf
Approximation algorithms for network design with metric costs.
STOC
Joseph Cheriyan, Adrian Vetta
2005 A* conf
Nash Equilibria in Random Games.
FOCS
Imre Bárány, Santosh S. Vempala, Adrian Vetta
2005 J jnl
Planar graph bipartization in linear time.
Electron. Notes Discret. Math.
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
2005 A* conf
Sink Equilibria and Convergence.
FOCS
Michel X. Goemans, Vahab S. Mirrokni, Adrian Vetta
2004 A* conf
(Almost) tight bounds and existence theorems for confluent flows.
STOC
Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
2004 — conf
Convergence Issues in Competitive Games.
APPROX-RANDOM
Vahab S. Mirrokni, Adrian Vetta
2004 J jnl
Finding odd cycle transversals.
Oper. Res. Lett.
Bruce A. Reed, Kaleigh Smith, Adrian Vetta
2004 J jnl
Lighting fibers in a dark network.
IEEE J. Sel. Areas Commun.
F. Bruce Shepherd, Adrian Vetta
2004 J jnl
On clusterings: Good, bad and spectral.
J. ACM
Ravi Kannan, Santosh S. Vempala, Adrian Vetta
2003 J jnl
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.
SIAM J. Comput.
Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta
2002 A* conf
Approximation algorithms for minimum-cost k-vertex connected subgraphs.
STOC
Joseph Cheriyan, Santosh S. Vempala, Adrian Vetta
2002 A* conf
Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions.
FOCS
Adrian Vetta
2002 B conf
The Demand Matching Problem.
IPCO
F. Bruce Shepherd, Adrian Vetta
2001 A* conf
Approximating the minimum strongly connected subgraph via a matching lower bound.
SODA
Adrian Vetta
2000 — conf
Factor 4/3 approximations for minimum 2-connected subgraphs.
APPROX
Santosh S. Vempala, Adrian Vetta
2000 A* conf
On Clusterings - Good, Bad and Spectral.
FOCS
Ravi Kannan, Santosh S. Vempala, Adrian Vetta