| Publication | Date of Publication | Type |
|---|
A recursive measure of voting power that satisfies reasonable postulates
Games and Economic Behavior | 2025-01-17 | Paper |
Penalties and rewards for fair learning in paired kidney exchange programs
| 2024-09-20 | Paper |
The price of anarchy of probabilistic serial in one-sided allocation problems
| 2024-09-20 | Paper |
Fair algorithm design: fair and efficacious machine scheduling
| 2024-05-29 | Paper |
One n Remains to Settle the Tree Conjecture
| 2023-10-12 | Paper |
An improved bound for the tree conjecture in network creation games
Algorithmic Game Theory | 2023-07-28 | Paper |
The blocker postulates for measures of voting power
Social Choice and Welfare | 2023-07-11 | Paper |
The price of anarchy of two-buyer sequential multiunit auctions
| 2023-03-21 | Paper |
Two-buyer sequential multiunit auctions with no overbidding
| 2022-12-21 | Paper |
How many freemasons are there? The consensus voting mechanism in metric spaces
| 2022-12-21 | Paper |
The declining price anomaly is not universal in multi-buyer sequential auctions (but almost is)
Theory of Computing Systems | 2022-06-21 | Paper |
Risk-free bidding in complement-free combinatorial auctions
Theory of Computing Systems | 2022-06-21 | Paper |
Two birds with one stone: fairness and welfare via transfers
| 2022-06-01 | Paper |
Improved two sample revenue guarantees via mixed-integer linear programming
| 2022-06-01 | Paper |
The price of stability of envy-free equilibria in multi-buyer sequential auctions
| 2022-06-01 | Paper |
Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality?
| 2022-06-01 | Paper |
Pirates in wonderland: liquid democracy has bicriteria guarantees
| 2022-06-01 | Paper |
Tight bounds on the relative performances of pricing optimization mechanisms in storable good markets
Discrete Optimization | 2022-01-18 | Paper |
The fair division of hereditary set systems
| 2020-06-18 | Paper |
The declining price anomaly is not universal in multi-buyer sequential auctions (but almost is)
Algorithmic Game Theory | 2020-02-04 | Paper |
Risk-free bidding in complement-free combinatorial auctions
Lecture Notes in Computer Science | 2020-02-04 | Paper |
A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Clique cover on sparse networks
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
The finite horizon, undiscounted, durable goods monopoly problem with finitely many consumers
Journal of Mathematical Economics | 2019-06-26 | Paper |
Computation in causal graphs
Journal of Graph Algorithms and Applications | 2019-05-24 | Paper |
scientific article; zbMATH DE number 7053371 (Why is no real title available?)
| 2019-05-10 | Paper |
Pricing policies for selling indivisible storable goods to strategic consumers
Annals of Operations Research | 2019-03-06 | Paper |
Tight bounds on the relative performances of pricing mechanisms in storable good markets
| 2018-11-08 | Paper |
Approximating rooted Steiner networks
ACM Transactions on Algorithms | 2018-10-30 | Paper |
On the Economic Efficiency of the Combinatorial Clock Auction
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
The inapproximability of maximum single-sink unsplittable, priority and confluent flow problems
Theory of Computing | 2018-01-10 | Paper |
Large Supports are required for Well-Supported Nash Equilibria
| 2017-08-31 | Paper |
Welfare and rationality guarantees for the simultaneous multiple-round ascending auction
Web and Internet Economics | 2016-01-08 | Paper |
Testing consumer rationality using perfect graphs and oriented discs
Web and Internet Economics | 2016-01-08 | Paper |
scientific article; zbMATH DE number 6515828 (Why is no real title available?)
| 2015-12-03 | Paper |
The combinatorial world (of auctions) according to GARP
Algorithmic Game Theory | 2015-11-04 | Paper |
Coalition Games on Interaction Graphs: A Horticultural Perspective
| 2015-02-26 | Paper |
Routing regardless of network stability
Algorithmica | 2015-01-19 | Paper |
Polylogarithmic supports are required for approximate well-supported Nash equilibria below 2/3
Web and Internet Economics | 2015-01-12 | Paper |
A near-optimal mechanism for impartial selection
Web and Internet Economics | 2015-01-07 | Paper |
To save or not to save: the Fisher game
Web and Internet Economics | 2015-01-07 | Paper |
An approximation algorithm for the maximum leaf spanning arborescence problem
ACM Transactions on Algorithms | 2014-11-18 | Paper |
A priority-based model of routing
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
The complexity of the simultaneous cluster problem
Journal of Graph Algorithms and Applications | 2014-01-22 | Paper |
Defending planar graphs against star-cutsets
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
A theoretical examination of practical game playing: lookahead search
Algorithmic Game Theory | 2013-03-13 | Paper |
Routing regardless of network stability
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On the efficiency of markets with two-sided proportional allocation mechanisms
Algorithmic Game Theory | 2010-10-19 | Paper |
Maximum flows on disjoint paths
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
On clusterings: good, bad and spectral
Journal of the ACM | 2010-08-17 | Paper |
Approximation algorithms for network design with metric costs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
(Almost) tight bounds and existence theorems for confluent flows
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Approximation algorithms for minimum-cost k-vertex connected subgraphs
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
An upper bound for the chromatic number of line graphs
| 2010-07-30 | Paper |
Galaxy cutsets in graphs
Journal of Combinatorial Optimization | 2010-06-11 | Paper |
Bounds on the cleaning times of robot vacuums
Operations Research Letters | 2010-03-18 | Paper |
On the odd-minor variant of Hadwiger's conjecture
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM | 2008-12-21 | Paper |
Approximation Algorithms for Network Design with Metric Costs
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
The Demand-Matching Problem
Mathematics of Operations Research | 2008-05-27 | Paper |
Planar graph bipartization in linear time
Discrete Applied Mathematics | 2008-04-16 | Paper |
Nash equilibria in random games
Random Structures \& Algorithms | 2008-01-08 | Paper |
An upper bound for the chromatic number of line graphs
European Journal of Combinatorics | 2007-11-21 | Paper |
Approximate Min-max Relations for Odd Cycles in Planar Graphs
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
scientific article; zbMATH DE number 5158512 (Why is no real title available?)
| 2007-05-29 | Paper |
Approximate min-max relations for odd cycles in planar graphs
Mathematical Programming. Series A. Series B | 2007-04-19 | Paper |
Network design via iterative rounding of setpair relaxations
Combinatorica | 2007-01-08 | Paper |
scientific article; zbMATH DE number 2246594 (Why is no real title available?)
| 2006-01-13 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Finding odd cycle transversals.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2086940 (Why is no real title available?)
| 2004-08-11 | Paper |
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
SIAM Journal on Computing | 2003-09-28 | Paper |
Approximating the minimum strongly connected subgraph via a matching lower bound
| 2002-01-30 | Paper |
scientific article; zbMATH DE number 1670548 (Why is no real title available?)
| 2001-11-11 | Paper |
