| Publication | Date of Publication | Type |
|---|
Optimizing over serial dictatorships
Theory of Computing Systems | 2024-11-12 | Paper |
| Optimizing over serial dictatorships | 2024-05-29 | Paper |
| Repeatedly matching items to agents fairly and efficiently | 2024-05-29 | Paper |
| Computing better approximate pure Nash equilibria in cut games via semidefinite programming | 2024-05-08 | Paper |
Repeatedly matching items to agents fairly and efficiently
Theoretical Computer Science | 2024-02-23 | Paper |
Truthful ownership transfer with expert advice
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Portioning using ordinal preferences: fairness and efficiency
Artificial Intelligence | 2023-01-04 | Paper |
The metric distortion of multiwinner voting
Artificial Intelligence | 2022-11-08 | Paper |
| On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies | 2022-07-21 | Paper |
| Almost envy-free allocations with connected bundles | 2022-07-18 | Paper |
| Relaxing the independence assumption in sequential posted pricing, prophet inequality, and random bipartite matching | 2022-07-06 | Paper |
Computing envy-freeable allocations with limited subsidies
(available as arXiv preprint) | 2022-07-06 | Paper |
Impartial selection with additive approximation guarantees
Theory of Computing Systems | 2022-06-21 | Paper |
Almost envy-free allocations with connected bundles
Games and Economic Behavior | 2022-02-25 | Paper |
Almost envy-free allocations with connected bundles
Games and Economic Behavior | 2022-02-25 | Paper |
Bounding the inefficiency of compromise in opinion formation
Algorithmica | 2022-02-01 | Paper |
Stable fractional matchings
Artificial Intelligence | 2021-11-02 | Paper |
Stable fractional matchings
Artificial Intelligence | 2021-11-02 | Paper |
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
Mathematics of Operations Research | 2021-07-15 | Paper |
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users
Mathematics of Operations Research | 2021-07-15 | Paper |
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
Journal of Computer and System Sciences | 2021-02-02 | Paper |
On approximate pure Nash equilibria in weighted congestion games with polynomial latencies
Journal of Computer and System Sciences | 2021-02-02 | Paper |
| Dogson's rule and Yong's rule | 2020-11-12 | Paper |
| Simple greedy algorithms for fundamental multidimensional graph problems | 2020-05-27 | Paper |
Impartial selection with additive approximation guarantees
Algorithmic Game Theory | 2020-02-04 | Paper |
Impartial selection with additive approximation guarantees
Algorithmic Game Theory | 2020-02-04 | Paper |
Limitations of Deterministic Auction Design for Correlated Bidders
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Optimizing positional scoring rules for rank aggregation
Artificial Intelligence | 2019-08-28 | Paper |
Optimizing positional scoring rules for rank aggregation
Artificial Intelligence | 2019-08-28 | Paper |
| On the approximability of Dodgson and Young elections | 2019-05-06 | Paper |
| Efficient coordination mechanisms for unrelated machine scheduling | 2019-05-06 | Paper |
An almost ideal coordination mechanism for unrelated machine scheduling
Theory of Computing Systems | 2019-03-21 | Paper |
Information retention in heterogeneous majority dynamics
Web and Internet Economics | 2019-01-30 | Paper |
Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling
Web and Internet Economics | 2019-01-30 | Paper |
Opting into optimal matchings
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Near-optimal asymmetric binary matrix partitions
Algorithmica | 2018-02-28 | Paper |
Efficiency and complexity of price competition among single-product vendors
Artificial Intelligence | 2017-09-29 | Paper |
Efficiency and complexity of price competition among single-product vendors
Artificial Intelligence | 2017-09-29 | Paper |
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
Algorithmica | 2017-05-02 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Web and Internet Economics | 2017-02-10 | Paper |
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Web and Internet Economics | 2017-02-10 | Paper |
Welfare guarantees for proportional allocations
Theory of Computing Systems | 2017-02-01 | Paper |
Welfare guarantees for proportional allocations
Theory of Computing Systems | 2017-02-01 | Paper |
Subset selection via implicit utilitarian voting
Journal of Artificial Intelligence Research | 2017-01-18 | Paper |
An almost ideal coordination mechanism for unrelated machine scheduling
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Minority becomes majority in social networks
Web and Internet Economics | 2016-01-08 | Paper |
Optimal social choice functions: a utilitarian view
Artificial Intelligence | 2015-12-21 | Paper |
Space lower bounds for low-stretch greedy embeddings
Theoretical Computer Science | 2015-12-10 | Paper |
Near-optimal asymmetric binary matrix partitions
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Near-optimal asymmetric binary matrix partitions
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Socially desirable approximations for dodgson’s voting rule
ACM Transactions on Algorithms | 2015-08-14 | Paper |
An improved 2-agent kidney exchange mechanism
Theoretical Computer Science | 2015-06-01 | Paper |
Enforcing efficient equilibria in network design games via subsidies
Algorithmica | 2015-05-21 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Bounding the inefficiency of outcomes in generalized second price auctions
Journal of Economic Theory | 2015-02-13 | Paper |
Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Welfare guarantees for proportional allocations
Algorithmic Game Theory | 2015-01-14 | Paper |
Taxes for linear atomic congestion games
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Efficient computation of approximate pure Nash equilibria in congestion games
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Limitations of deterministic auction design for correlated bidders
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
Improved lower bounds on the price of stability of undirected network design games
Theory of Computing Systems | 2013-08-01 | Paper |
Efficient coordination mechanisms for unrelated machine scheduling
Algorithmica | 2013-06-25 | Paper |
Energy-efficient communication in multi-interface wireless networks
Theory of Computing Systems | 2013-04-15 | Paper |
A 6/5-approximation algorithm for the maximum 3-cover problem
Journal of Combinatorial Optimization | 2013-04-08 | Paper |
The efficiency of fair division
Theory of Computing Systems | 2012-12-06 | Paper |
On the approximability of Dodgson and Young elections
Artificial Intelligence | 2012-11-15 | Paper |
Space lower bounds for low-stretch greedy embeddings
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Revenue guarantees in sponsored search auctions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Voting almost maximizes social welfare despite limited communication
Artificial Intelligence | 2011-11-17 | Paper |
Tight bounds for selfish and greedy load balancing
Algorithmica | 2011-11-07 | Paper |
Tight approximation bounds for greedy frugal coverage algorithms
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Improved lower bounds on the price of stability of undirected network design games
Algorithmic Game Theory | 2010-10-19 | Paper |
Fractional path coloring in bounded degree trees with applications
Algorithmica | 2010-09-16 | Paper |
| scientific article; zbMATH DE number 5764829 (Why is no real title available?) | 2010-08-06 | Paper |
Wavelength management in WDM rings to maximize the number of connections
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Energy consumption minimization in ad hoc wireless and multi-interface networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
Game-theoretic approaches to optimization problems in communication networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
On Low-Envy Truthful Allocations
Algorithmic Decision Theory | 2009-11-17 | Paper |
Energy-Efficient Communication in Multi-interface Wireless Networks
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
An Improved Approximation Bound for Spanning Star Forest and Color Saving
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
Theory of Computing Systems | 2009-09-02 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
Information Processing Letters | 2009-03-23 | Paper |
Tight Bounds for Selfish and Greedy Load Balancing
Automata, Languages and Programming | 2009-03-12 | Paper |
Scheduling to Maximize Participation
Trustworthy Global Computing | 2009-03-05 | Paper |
A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Competitive algorithms and lower bounds for online randomized call control in cellular networks
Networks | 2008-12-17 | Paper |
Scheduling to maximize participation
Theoretical Computer Science | 2008-08-06 | Paper |
Approximation Algorithms for Path Coloring in Trees
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Taxes for Linear Atomic Congestion Games
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
Fundamentals of Computation Theory | 2008-02-26 | Paper |
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless Networks
Automata, Languages and Programming | 2007-11-28 | Paper |
A tight bound for online colouring of disk graphs
Theoretical Computer Science | 2007-10-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Wavelength Management in WDM Rings to Maximize the Number of Connections
STACS 2007 | 2007-09-03 | Paper |
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
Discrete Applied Mathematics | 2007-02-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Energy-efficient wireless network design
Theory of Computing Systems | 2006-10-16 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2044917 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1979511 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1862254 (Why is no real title available?) | 2003-01-30 | Paper |
New bounds on the size of the minimum feedback vertex set in meshes and butterflies.
Information Processing Letters | 2003-01-21 | Paper |
Randomized path coloring on binary trees.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1820026 (Why is no real title available?) | 2002-12-10 | Paper |
Efficient on-line frequency allocation and call control in cellular networks
Theory of Computing Systems | 2002-09-25 | Paper |
| scientific article; zbMATH DE number 1754632 (Why is no real title available?) | 2002-06-12 | Paper |
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science | 2002-03-03 | Paper |
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1670530 (Why is no real title available?) | 2002-01-06 | Paper |
| scientific article; zbMATH DE number 1418353 (Why is no real title available?) | 2000-10-08 | Paper |
| scientific article; zbMATH DE number 1303778 (Why is no real title available?) | 2000-03-29 | Paper |
