Adrian Vetta

Orcid: 0000-0002-2213-4937

Affiliations:
  • McGill University, Montreal, Canada


According to our database1, Adrian Vetta authored at least 85 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
One n Remains to Settle the Tree Conjecture.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
The blocker postulates for measures of voting power.
Soc. Choice Welf., May, 2023

The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions.
ACM Trans. Economics and Comput., 2023

Gerrymandering Planar Graphs.
CoRR, 2023

The Price of Anarchy in One-Sided Allocation Problems with Multi-Unit Demand Agents.
CoRR, 2023

The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs.
Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Fair Algorithm Design: Fair and Efficacious Machine Scheduling.
Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022
Risk-Free Bidding in Complement-Free Combinatorial Auctions.
Theory Comput. Syst., 2022

The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is).
Theory Comput. Syst., 2022

A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited.
CoRR, 2022

An Improved Bound for the Tree Conjecture in Network Creation Games.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2021
The Fair Division of Hereditary Set Systems.
ACM Trans. Economics and Comput., 2021

Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.
Discret. Optim., 2021

A Recursive Measure of Voting Power that Satisfies Reasonable Postulates.
CoRR, 2021

Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Descending the Stable Matching Lattice: How Many Strategic Agents Are Required to Turn Pessimality to Optimality?
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Two Birds with One Stone: Fairness and Welfare via Transfers.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

A Case Study in Learning in Metagames: Super Smash Bros. Melee.
Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

2020
One Dollar Each Eliminates Envy.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

How Many Freemasons Are There? The Consensus Voting Mechanism in Metric Spaces.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Two-Buyer Sequential Multiunit Auctions with No Overbidding.
Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

2019
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem.
ACM Trans. Algorithms, 2019

Computation in Causal Graphs.
J. Graph Algorithms Appl., 2019

Pricing policies for selling indivisible storable goods to strategic consumers.
Ann. Oper. Res., 2019

2018
The Combinatorial Clock Auction: the Effects of Strategic Behaviour and the Price Increment Rule on Social Welfare.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.
Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems.
Theory Comput., 2017

2016
On the Economic Efficiency of the Combinatorial Clock Auction.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Reducing the rank of a matroid.
Discret. Math. Theor. Comput. Sci., 2015

The Storable Good Monopoly Problem with Indivisible Demand.
CoRR, 2015

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Testing Consumer Rationality Using Perfect Graphs and Oriented Discs.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Coalition Games on Interaction Graphs: A Horticultural Perspective.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

The Combinatorial World (of Auctions) According to GARP.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Large Supports are Required for Well-Supported Nash Equilibria.
Proceedings of the Approximation, 2015

2014
Approximating Rooted Steiner Networks.
ACM Trans. Algorithms, 2014

Pricing mechanisms for a durable good monopolist.
SIGMETRICS Perform. Evaluation Rev., 2014

The Complexity of the Simultaneous Cluster Problem.
J. Graph Algorithms Appl., 2014

Routing Regardless of Network Stability.
Algorithmica, 2014

To Save Or Not To Save: The Fisher Game.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A Near-Optimal Mechanism for Impartial Selection.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Bounds on the Profitability of a Durable Good Monopolist.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Randomized Experimental Design for Causal Graph Discovery.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

False-Name Bidding and Economic Efficiency in Combinatorial Auctions.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
On the Implications of Lookahead Search in Game Playing
CoRR, 2012

Non-redistributive Second Welfare Theorems.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A Theoretical Examination of Practical Game Playing: Lookahead Search.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Clique Cover on Sparse Networks.
Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2010
An approximation algorithm for the maximum leaf spanning arborescence problem.
ACM Trans. Algorithms, 2010

Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets.
PLoS Comput. Biol., 2010

Bounds on the cleaning times of robot vacuums.
Oper. Res. Lett., 2010

Galaxy cutsets in graphs.
J. Comb. Optim., 2010

Predicting direct protein interactions from affinity purification mass spectrometry data.
Algorithms Mol. Biol., 2010

On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms.
Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Maximum Flows on Disjoint Paths.
Proceedings of the Approximation, 2010

2009
On the odd-minor variant of Hadwiger's conjecture.
J. Comb. Theory, Ser. B, 2009

Defending Planar Graphs against Star-Cutsets.
Electron. Notes Discret. Math., 2009

Computational Aspects of Multimarket Price Wars.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008
A Priority-Based Model of Routing.
Chic. J. Theor. Comput. Sci., 2008

2007
Approximation Algorithms for Network Design with Metric Costs.
SIAM J. Discret. Math., 2007

Nash equilibria in random games.
Random Struct. Algorithms, 2007

Approximate min-max relations for odd cycles in planar graphs.
Math. Program., 2007

The Demand-Matching Problem.
Math. Oper. Res., 2007

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.
J. Graph Algorithms Appl., 2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.
J. ACM, 2007

An upper bound for the chromatic number of line graphs.
Eur. J. Comb., 2007

Degree-constrained network flows.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Network Design Via Iterative Rounding Of Setpair Relaxations.
Comb., 2006

2005
Planar graph bipartization in linear time.
Electron. Notes Discret. Math., 2005

Sink Equilibria and Convergence.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Finding odd cycle transversals.
Oper. Res. Lett., 2004

Lighting fibers in a dark network.
IEEE J. Sel. Areas Commun., 2004

On clusterings: Good, bad and spectral.
J. ACM, 2004

(Almost) tight bounds and existence theorems for confluent flows.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Convergence Issues in Competitive Games.
Proceedings of the Approximation, 2004

2003
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.
SIAM J. Comput., 2003

2002
Approximation algorithms for minimum-cost k-vertex connected subgraphs.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
Approximating the minimum strongly connected subgraph via a matching lower bound.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Factor 4/3 approximations for minimum 2-connected subgraphs.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000


  Loading...