Adrian Vetta

Bernhard von Stengel

CoRR, 2024

FPT Algorithms using Minimal Parameters for a Generalized Version of Maximin Shares.

[BibT_eX]

[DOI]

CoRR, 2024

Eliminating Majority Illusion is Easy.

[BibT_eX]

[DOI]

CoRR, 2024

<i>k</i>-Leaf Powers Cannot be Characterized by a Finite Set of Forbidden Induced Subgraphs for k ≥ 5.

[BibT_eX]

[DOI]

CoRR, 2024

One n Remains to Settle the Tree Conjecture.

[BibT_eX]

[DOI]

Jack Dippel

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Matrix Rationalization via Partial Orders.

[BibT_eX]

[DOI]

Agnes Totschnig

Rohit Vasishta

Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Robot Positioning Using Torus Packing for Multisets.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Gerrymandering Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

The blocker postulates for measures of voting power.

[BibT_eX]

[DOI]

Arash Abizadeh

Soc. Choice Welf., May, 2023

The Price of Anarchy of Two-Buyer Sequential Multiunit Auctions.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

The Price of Anarchy of Probabilistic Serial in One-Sided Allocation Problems.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Penalties and Rewards for Fair Learning in Paired Kidney Exchange Programs.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 19th International Conference, 2023

Fair Algorithm Design: Fair and Efficacious Machine Scheduling.

[BibT_eX]

[DOI]

April Niu

Agnes Totschnig

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022

Risk-Free Bidding in Complement-Free Combinatorial Auctions.

[BibT_eX]

[DOI]

Vishnu V. Narayan

Gautam Rayaprolu

Theory Comput. Syst., 2022

The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is).

[BibT_eX]

[DOI]

Vishnu V. Narayan

Enguerrand Prebet

Theory Comput. Syst., 2022

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

[BibT_eX]

[DOI]

Arash Abizadeh

CoRR, 2022

An Improved Bound for the Tree Conjecture in Network Creation Games.

[BibT_eX]

[DOI]

Jack Dippel

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

2021

The Fair Division of Hereditary Set Systems.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets.

[BibT_eX]

[DOI]

Discret. Optim., 2021

A Recursive Measure of Voting Power that Satisfies Reasonable Postulates.

[BibT_eX]

[DOI]

Arash Abizadeh

CoRR, 2021

Pirates in Wonderland: Liquid Democracy has Bicriteria Guarantees.

[BibT_eX]

[DOI]

Jonathan A. Noel

Mashbat Suzuki

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?

[BibT_eX]

[DOI]

Ndiamé Ndiaye

Sergey Norin

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Two Birds with One Stone: Fairness and Welfare via Transfers.

[BibT_eX]

[DOI]

Vishnu V. Narayan

Mashbat Suzuki

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Improved Two Sample Revenue Guarantees via Mixed-Integer Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

The Price of Stability of Envy-Free Equilibria in Multi-buyer Sequential Auctions.

[BibT_eX]

[DOI]

Brendan Lucier

Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

A Case Study in Learning in Metagames: Super Smash Bros. Melee.

[BibT_eX]

[DOI]

Julien Codsi

Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

2020

One Dollar Each Eliminates Envy.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Mashbat Suzuki

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

Two-Buyer Sequential Multiunit Auctions with No Overbidding.

[BibT_eX]

[DOI]

Brendan Lucier

Proceedings of the Algorithmic Game Theory - 13th International Symposium, 2020

2019

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem.

[BibT_eX]

[DOI]

Christoph Hunkenschröder

ACM Trans. Algorithms, 2019

Computation in Causal Graphs.

[BibT_eX]

[DOI]

Juli Atherton

Derek Ruths

J. Graph Algorithms Appl., 2019

Pricing policies for selling indivisible storable goods to strategic consumers.

[BibT_eX]

[DOI]

Gautam Rayaprolu

Ann. Oper. Res., 2019

2018

The Combinatorial Clock Auction: the Effects of Strategic Behaviour and the Price Increment Rule on Social Welfare.

[BibT_eX]

[DOI]

Max Dupré la Tour

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 11th International Symposium, 2018

2017

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

[BibT_eX]

[DOI]

Adrian R. Vetta

Theory Comput., 2017

2016

On the Economic Efficiency of the Combinatorial Clock Auction.

[BibT_eX]

[DOI]

Yang Cai

Christoph Hunkenschröder

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Reducing the rank of a matroid.

[BibT_eX]

[DOI]

Gwenaël Joret

Discret. Math. Theor. Comput. Sci., 2015

The Storable Good Monopoly Problem with Indivisible Demand.

[BibT_eX]

[DOI]

Gautam Rayaprolu

CoRR, 2015

Welfare and Rationality Guarantees for the Simultaneous Multiple-Round Ascending Auction.

[BibT_eX]

[DOI]

Yang Cai

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Testing Consumer Rationality Using Perfect Graphs and Oriented Discs.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Coalition Games on Interaction Graphs: A Horticultural Perspective.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

The Combinatorial World (of Auctions) According to GARP.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.

[BibT_eX]

[DOI]

Gordon T. Wilfong

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Large Supports are Required for Well-Supported Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2015

2014

Approximating Rooted Steiner Networks.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

Pricing mechanisms for a durable good monopolist.

[BibT_eX]

[DOI]

Peter Sloan

SIGMETRICS Perform. Evaluation Rev., 2014

The Complexity of the Simultaneous Cluster Problem.

[BibT_eX]

[DOI]

Manikandan Narayanan

J. Graph Algorithms Appl., 2014

Routing Regardless of Network Stability.

[BibT_eX]

[DOI]

Bundit Laekhanukit

Gordon T. Wilfong

Algorithmica, 2014

To Save Or Not To Save: The Fisher Game.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

A Near-Optimal Mechanism for Impartial Selection.

[BibT_eX]

[DOI]

Sergey Norin

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Bounds on the Profitability of a Durable Good Monopolist.

[BibT_eX]

[DOI]

Peter Sloan

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Randomized Experimental Design for Causal Graph Discovery.

[BibT_eX]

[DOI]

Huining Hu

Adrian R. Vetta

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.

[BibT_eX]

[DOI]

Colleen Alkalay-Houlihan

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.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

On the Implications of Lookahead Search in Game Playing

[BibT_eX]

[DOI]

Nithum Thain

CoRR, 2012

Non-redistributive Second Welfare Theorems.

[BibT_eX]

[DOI]

Bundit Laekhanukit

Guyslain Naves

Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

A Theoretical Examination of Practical Game Playing: Lookahead Search.

[BibT_eX]

[DOI]

Nithum Thain

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Clique Cover on Sparse Networks.

[BibT_eX]

[DOI]

Mathieu Blanchette

Ethan Kim

Proceedings of the 14th Meeting on Algorithm Engineering & Experiments, 2012

2010

An approximation algorithm for the maximum leaf spanning arborescence problem.

[BibT_eX]

[DOI]

Matthew Drescher

ACM Trans. Algorithms, 2010

Simultaneous Clustering of Multiple Gene Expression and Physical Interaction Datasets.

[BibT_eX]

[DOI]

PLoS Comput. Biol., 2010

Bounds on the cleaning times of robot vacuums.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

Galaxy cutsets in graphs.

[BibT_eX]

[DOI]

Nicolas Sonnerat

J. Comb. Optim., 2010

Predicting direct protein interactions from affinity purification mass spectrometry data.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2010

On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms.

[BibT_eX]

[DOI]

Volodymyr Kuleshov

Proceedings of the Algorithmic Game Theory - Third International Symposium, 2010

Maximum Flows on Disjoint Paths.

[BibT_eX]

[DOI]

Guyslain Naves

Nicolas Sonnerat

Proceedings of the Approximation, 2010

2009

On the odd-minor variant of Hadwiger's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Defending Planar Graphs against Star-Cutsets.

[BibT_eX]

[DOI]

Nicolas Sonnerat

Electron. Notes Discret. Math., 2009

Computational Aspects of Multimarket Price Wars.

[BibT_eX]

[DOI]

Nithum Thain

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

2008

Planar graph bipartization in linear time.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

A Priority-Based Model of Routing.

[BibT_eX]

[DOI]

Babak Farzad

Neil Olver

Chic. J. Theor. Comput. Sci., 2008

2007

Approximation Algorithms for Network Design with Metric Costs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Nash equilibria in random games.

[BibT_eX]

[DOI]

Imre Bárány

Random Struct. Algorithms, 2007

Approximate min-max relations for odd cycles in planar graphs.

[BibT_eX]

[DOI]

Math. Program., 2007

The Demand-Matching Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2007

A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Neil Olver

J. Graph Algorithms Appl., 2007

(Almost) Tight bounds and existence theorems for single-commodity confluent flows.

[BibT_eX]

[DOI]

J. ACM, 2007

An upper bound for the chromatic number of line graphs.

[BibT_eX]

[DOI]

Andrew D. King

Bruce A. Reed

Eur. J. Comb., 2007

Degree-constrained network flows.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Network Design Via Iterative Rounding Of Setpair Relaxations.

[BibT_eX]

[DOI]

Comb., 2006

2005

Sink Equilibria and Convergence.

[BibT_eX]

[DOI]

Michel X. Goemans

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Finding odd cycle transversals.

[BibT_eX]

[DOI]

Bruce A. Reed

Kaleigh Smith

Oper. Res. Lett., 2004

Lighting fibers in a dark network.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2004

On clusterings: Good, bad and spectral.

[BibT_eX]

[DOI]

Ravi Kannan

J. ACM, 2004

(Almost) tight bounds and existence theorems for confluent flows.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Convergence Issues in Competitive Games.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2004

2003

An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph.

[BibT_eX]

[DOI]

SIAM J. Comput., 2003

2002

Approximation algorithms for minimum-cost k-vertex connected subgraphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000

Factor 4/3 approximations for minimum 2-connected subgraphs.

[BibT_eX]

[DOI]