| Publication | Date of Publication | Type |
|---|
The competition complexity of prophet inequalities
Mathematics of Operations Research | 2026-03-20 | Paper |
| Equilibrium dynamics in market games with exchangeable and divisible resources | 2024-11-28 | Paper |
The competition complexity of dynamic pricing
Mathematics of Operations Research | 2024-11-07 | Paper |
Optimal item pricing in online combinatorial auctions
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| A constant factor prophet inequality for online combinatorial auctions | 2024-05-08 | Paper |
Sample-Driven Optimal Stopping: From the Secretary Problem to the i.i.d. Prophet Inequality
Mathematics of Operations Research | 2024-03-05 | Paper |
scientific article; zbMATH DE number 7788460 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
| Optimal item pricing in online combinatorial auctions | 2022-08-16 | Paper |
Prophet inequalities for independent and identically distributed random variables from an unknown distribution
Mathematics of Operations Research | 2022-06-27 | Paper |
On the price of anarchy for flows over time
Mathematics of Operations Research | 2022-06-27 | Paper |
Optimal revenue guarantees for pricing in large markets
(available as arXiv preprint) | 2022-06-01 | Paper |
Performance guarantees of local search for minsum scheduling problems
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Network pricing: how to induce optimal flows under strategic link operators
Operations Research | 2022-02-18 | Paper |
Long-term behavior of dynamic equilibria in fluid queuing networks
Operations Research | 2022-02-18 | Paper |
Posted price mechanisms and optimal threshold strategies for random arrivals
Mathematics of Operations Research | 2022-02-08 | Paper |
On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables
Operations Research Letters | 2021-12-13 | Paper |
Prophet secretary through blind strategies
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
The Two-Sided Game of Googol and Sample-Based Prophet Inequalities
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
The inefficiency of Nash and subgame perfect equilibria for network routing
Mathematics of Operations Research | 2020-04-30 | Paper |
From pricing to prophets, and back!
Operations Research Letters | 2020-02-10 | Paper |
Prophet secretary through blind strategies
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
Naval Research Logistics | 2019-03-05 | Paper |
Sensitivity analysis of markup equilibria in complementary markets
Operations Research Letters | 2018-08-27 | Paper |
Splitting versus setup trade-offs for scheduling to minimize weighted completion time
Operations Research Letters | 2018-02-06 | Paper |
| Adaptivity in network interdiction | 2017-10-27 | Paper |
| Long term behavior of dynamic equilibria in fluid queuing networks | 2017-08-31 | Paper |
Long term behavior of dynamic equilibria in fluid queuing networks
(available as arXiv preprint) | 2017-08-31 | Paper |
| On guillotine cutting sequences | 2017-08-31 | Paper |
Fare evasion in transit networks
Operations Research | 2017-06-02 | Paper |
Contingent preannounced pricing policies with strategic consumers
Operations Research | 2016-05-13 | Paper |
Bounds on the welfare loss from moral hazard with limited liability
Games and Economic Behavior | 2016-03-01 | Paper |
The curse of sequentiality in routing games
Web and Internet Economics | 2016-01-08 | Paper |
Adaptive rumor spreading
Web and Internet Economics | 2016-01-08 | Paper |
Strong LP formulations for scheduling splittable jobs on unrelated machines
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
Dynamic equilibria in fluid queueing networks
Operations Research | 2015-10-22 | Paper |
Decentralized utilitarian mechanisms for scheduling games
Games and Economic Behavior | 2015-08-12 | Paper |
| Approximation schemes for multidimensional packing | 2015-08-03 | Paper |
TSP tours in cubic graphs: beyond 4/3
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry | 2015-04-16 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity
Discrete & Computational Geometry | 2015-04-16 | Paper |
Clique partitioning with value-monotone submodular cost
Discrete Optimization | 2015-04-09 | Paper |
The price of anarchy of the proportional allocation mechanism revisited
Web and Internet Economics | 2015-01-12 | Paper |
Optimal Coordination Mechanisms for Multi-job Scheduling Games
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Pricing with markups in industries with increasing marginal costs
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
Inner product spaces for minsum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Inner product spaces for minsum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Independent and hitting sets of rectangles intersecting a diagonal line
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
TSP tours in cubic graphs: beyond 4/3
Algorithms – ESA 2012 | 2012-09-25 | Paper |
The power of preemption on unrelated machines and applications to scheduling orders
Mathematics of Operations Research | 2012-05-24 | Paper |
On the \(p\)-median polytope of fork-free graphs
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
The impact of oligopolistic competition in networks
Operations Research | 2011-11-24 | Paper |
Optimal selection of customers for a last-minute offer
Operations Research | 2011-11-17 | Paper |
On the \(p\)-median polytope and the intersection property: polyhedra and algorithms
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Existence and Uniqueness of Equilibria for Flows over Time
Automata, Languages and Programming | 2011-07-07 | Paper |
Monotone covering problems with an additional covering constraint
Mathematics of Operations Research | 2011-04-27 | Paper |
The cost of moral hazard and limited liability in the principal-agent problem
Lecture Notes in Computer Science | 2011-01-10 | Paper |
Approximating a class of combinatorial problems with rational objective function
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
An approximate König's theorem for edge-coloring weighted bipartite graphs
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
On the planner's loss due to lack of information in Bayesian mechanism design
Algorithmic Game Theory | 2009-12-01 | Paper |
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Fast, Fair, and Efficient Flows in Networks
Operations Research | 2009-08-13 | Paper |
LP-based online scheduling: From single to parallel machines
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
Network Games with Atomic Players
Automata, Languages and Programming | 2009-03-12 | Paper |
Bin packing with controllable item sizes
Information and Computation | 2009-03-04 | Paper |
A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
A geometric approach to the price of anarchy in nonatomic congestion games
Games and Economic Behavior | 2009-01-26 | Paper |
Improved Bounds on Nonblocking 3-Stage Clos Networks
SIAM Journal on Computing | 2008-06-19 | Paper |
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Mathematics of Operations Research | 2008-05-27 | Paper |
Single-Machine Scheduling with Precedence Constraints
Mathematics of Operations Research | 2008-05-27 | Paper |
Some remarks about factors of graphs
Journal of Graph Theory | 2008-05-14 | Paper |
A fast asymptotic approximation scheme for bin packing with rejection
Theoretical Computer Science | 2008-04-15 | Paper |
A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
Approximation and Online Algorithms | 2008-02-20 | Paper |
Approximating Rational Objectives Is as Easy as Approximating Linear Ones
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
On the Inefficiency of Equilibria in Congestion Games
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
LP-Based Online Scheduling: From Single to Parallel Machines
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
| scientific article; zbMATH DE number 5158491 (Why is no real title available?) | 2007-05-29 | Paper |
A note on the precedence-constrained class sequencing problem
Discrete Applied Mathematics | 2007-03-02 | Paper |
The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation
Discrete Optimization | 2006-10-10 | Paper |
Resource augmentation in two-dimensional packing with orthogonal rotations
Operations Research Letters | 2006-01-18 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2230208 (Why is no real title available?) | 2005-11-18 | Paper |
Selfish Routing in Capacitated Networks
Mathematics of Operations Research | 2005-11-11 | Paper |
Common-Lines and Passenger Assignment in Congested Transit Networks
Transportation Science | 2003-08-24 | Paper |
