| Publication | Date of Publication | Type |
|---|
| Equilibrium dynamics in market games with exchangeable and divisible resources | 2024-11-28 | Paper |
| The competition complexity of dynamic pricing | 2024-11-07 | Paper |
| Optimal item pricing in online combinatorial auctions | 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 | 2024-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147378 | 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 | 2022-06-27 | Paper |
| On the price of anarchy for flows over time | 2022-06-27 | Paper |
| Optimal revenue guarantees for pricing in large markets | 2022-06-01 | Paper |
| Performance guarantees of local search for minsum scheduling problems | 2022-03-22 | Paper |
| Network pricing: how to induce optimal flows under strategic link operators | 2022-02-18 | Paper |
| Long-term behavior of dynamic equilibria in fluid queuing networks | 2022-02-18 | Paper |
| Posted price mechanisms and optimal threshold strategies for random arrivals | 2022-02-08 | Paper |
| On the asymptotic behavior of the expectation of the maximum of i.i.d. random variables | 2021-12-13 | Paper |
| Prophet secretary through blind strategies | 2021-10-20 | Paper |
| The Two-Sided Game of Googol and Sample-Based Prophet Inequalities | 2021-02-02 | Paper |
| The inefficiency of Nash and subgame perfect equilibria for network routing | 2020-04-30 | Paper |
| From pricing to prophets, and back! | 2020-02-10 | Paper |
| Prophet secretary through blind strategies | 2019-10-15 | Paper |
| Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost | 2019-03-05 | Paper |
| Sensitivity analysis of markup equilibria in complementary markets | 2018-08-27 | Paper |
| Splitting versus setup trade-offs for scheduling to minimize weighted completion time | 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 |
| On guillotine cutting sequences | 2017-08-31 | Paper |
| Fare evasion in transit networks | 2017-06-02 | Paper |
| Contingent preannounced pricing policies with strategic consumers | 2016-05-13 | Paper |
| Bounds on the welfare loss from moral hazard with limited liability | 2016-03-01 | Paper |
| The curse of sequentiality in routing games | 2016-01-08 | Paper |
| Adaptive rumor spreading | 2016-01-08 | Paper |
| Strong LP formulations for scheduling splittable jobs on unrelated machines | 2015-12-09 | Paper |
| Dynamic equilibria in fluid queueing networks | 2015-10-22 | Paper |
| Decentralized utilitarian mechanisms for scheduling games | 2015-08-12 | Paper |
| Approximation schemes for multidimensional packing | 2015-08-03 | Paper |
| TSP tours in cubic graphs: beyond 4/3 | 2015-06-08 | Paper |
| Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity | 2015-04-16 | Paper |
| Clique partitioning with value-monotone submodular cost | 2015-04-09 | Paper |
| The price of anarchy of the proportional allocation mechanism revisited | 2015-01-12 | Paper |
| Optimal Coordination Mechanisms for Multi-job Scheduling Games | 2014-10-08 | Paper |
| Pricing with markups in industries with increasing marginal costs | 2014-08-29 | Paper |
| Inner product spaces for MinSum coordination mechanisms | 2014-06-05 | Paper |
| Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines | 2014-06-02 | Paper |
| Independent and hitting sets of rectangles intersecting a diagonal line | 2014-03-31 | Paper |
| TSP tours in cubic graphs: beyond 4/3 | 2012-09-25 | Paper |
| The power of preemption on unrelated machines and applications to scheduling orders | 2012-05-24 | Paper |
| On the \(p\)-median polytope of fork-free graphs | 2012-05-13 | Paper |
| The impact of oligopolistic competition in networks | 2011-11-24 | Paper |
| Optimal selection of customers for a last-minute offer | 2011-11-17 | Paper |
| On the \(p\)-median polytope and the intersection property: polyhedra and algorithms | 2011-10-27 | Paper |
| Existence and Uniqueness of Equilibria for Flows over Time | 2011-07-07 | Paper |
| Monotone covering problems with an additional covering constraint | 2011-04-27 | Paper |
| The cost of moral hazard and limited liability in the principal-agent problem | 2011-01-10 | Paper |
| Approximating a class of combinatorial problems with rational objective function | 2010-09-16 | Paper |
| An approximate König's theorem for edge-coloring weighted bipartite graphs | 2010-08-15 | Paper |
| On the planner's loss due to lack of information in Bayesian mechanism design | 2009-12-01 | Paper |
| The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders | 2009-10-28 | Paper |
| Fast, Fair, and Efficient Flows in Networks | 2009-08-13 | Paper |
| LP-based online scheduling: From single to parallel machines | 2009-04-24 | Paper |
| Network Games with Atomic Players | 2009-03-12 | Paper |
| Bin packing with controllable item sizes | 2009-03-04 | Paper |
| A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection | 2009-03-03 | Paper |
| A geometric approach to the price of anarchy in nonatomic congestion games | 2009-01-26 | Paper |
| Improved Bounds on Nonblocking 3-Stage Clos Networks | 2008-06-19 | Paper |
| Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes | 2008-05-27 | Paper |
| Single-Machine Scheduling with Precedence Constraints | 2008-05-27 | Paper |
| Some remarks about factors of graphs | 2008-05-14 | Paper |
| A fast asymptotic approximation scheme for bin packing with rejection | 2008-04-15 | Paper |
| A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs | 2008-02-20 | Paper |
| Approximating Rational Objectives Is as Easy as Approximating Linear Ones | 2007-09-07 | Paper |
| On the Inefficiency of Equilibria in Congestion Games | 2007-08-30 | Paper |
| LP-Based Online Scheduling: From Single to Parallel Machines | 2007-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3439669 | 2007-05-29 | Paper |
| A note on the precedence-constrained class sequencing problem | 2007-03-02 | Paper |
| The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation | 2006-10-10 | Paper |
| Resource augmentation in two-dimensional packing with orthogonal rotations | 2006-01-18 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| Integer Programming and Combinatorial Optimization | 2005-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708494 | 2005-11-18 | Paper |
| Selfish Routing in Capacitated Networks | 2005-11-11 | Paper |
| Common-Lines and Passenger Assignment in Congested Transit Networks | 2003-08-24 | Paper |
