| Publication | Date of Publication | Type |
|---|
On priority-proportional payments in financial networks
Theoretical Computer Science | 2024-10-07 | Paper |
| Not all strangers are the same: the impact of tolerance in schelling games | 2024-08-06 | Paper |
Not all strangers are the same: the impact of tolerance in Schelling games
Theoretical Computer Science | 2023-08-18 | Paper |
Modified Schelling games
Algorithmic Game Theory | 2022-12-21 | Paper |
Multi-agent systems for computational economics and finance
AI Communications | 2022-12-12 | Paper |
Fair cake-cutting in practice
Games and Economic Behavior | 2022-06-09 | Paper |
Fair cake-cutting in practice
Games and Economic Behavior | 2022-06-09 | Paper |
Modified Schelling games
Theoretical Computer Science | 2021-07-22 | Paper |
Modified Schelling games
Theoretical Computer Science | 2021-07-22 | Paper |
Almost envy-freeness in group resource allocation
Theoretical Computer Science | 2020-09-17 | Paper |
Almost envy-freeness in group resource allocation
Theoretical Computer Science | 2020-09-17 | Paper |
| Mechanism design for constrained heterogeneous facility location | 2020-02-04 | Paper |
Limitations of Deterministic Auction Design for Correlated Bidders
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
The anarchy of scheduling without money
Theoretical Computer Science | 2019-06-06 | Paper |
The anarchy of scheduling without money
Algorithmic Game Theory | 2016-09-29 | Paper |
The anarchy of scheduling without money
Algorithmic Game Theory | 2016-09-29 | Paper |
The VCG Mechanism for Bayesian Scheduling
Web and Internet Economics | 2016-01-08 | 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 |
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 |
The efficiency of fair division
Theory of Computing Systems | 2012-12-06 | Paper |
Revenue guarantees in sponsored search auctions
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Tight approximation bounds for greedy frugal coverage algorithms
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
On Low-Envy Truthful Allocations
Algorithmic Decision Theory | 2009-11-17 | Paper |
An Improved Approximation Bound for Spanning Star Forest and Color Saving
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
