default search action
Marc Uetz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c32]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. IJCAI 2024: 2842-2850 - [c31]Puck te Rietmole, Marc Uetz:
Sequencing Stochastic Jobs with a Single Sample. ISCO 2024: 235-247 - [c30]Wouter Fokkema, Ruben Hoeksma, Marc Uetz:
Price of Anarchy for Graphic Matroid Congestion Games. SAGT 2024: 371-388 - [i13]Simon Krogmann, Pascal Lenzner, Alexander Skopalik, Marc Uetz, Marnix C. Vos:
Equilibria in Two-Stage Facility Location with Atomic Clients. CoRR abs/2403.03114 (2024) - [i12]Ruben Hoeksma, Gavin Speek, Marc Uetz:
Stochastic Minimum Spanning Trees with a Single Sample. CoRR abs/2409.16119 (2024) - 2023
- [j32]Rong Zou, Wenzhong Li, Marc Uetz
, Genjiu Xu:
Two-step Shapley-solidarity value for cooperative games with coalition structure. OR Spectr. 45(1): 1-25 (2023) - [i11]Rong Zou, Boyue Lin, Marc Uetz, Matthias Walter:
Algorithmic Solutions for Maximizing Shareable Costs. CoRR abs/2303.00052 (2023) - [i10]Puck te Rietmole, Marc Uetz:
Sequencing Stochastic Jobs with a Single Sample. CoRR abs/2308.11461 (2023) - 2022
- [j31]Xianghui Li
Power surplus solutions for weighted hypergraph communication situations. Int. Trans. Oper. Res. 29(6): 3346-3369 (2022) - [j30]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma
In memoriam Gerhard Woeginger. Oper. Res. Lett. 50(3): iii (2022) - [j29]Jan Karel Lenstra, Franz Rendl, Frits C. R. Spieksma
In memoriam Gerhard Woeginger. J. Sched. 25(5): 503-505 (2022) - [c29]Joran van den Bosse, Marc Uetz, Matthias Walter:
Exact Price of Anarchy for Weighted Congestion Games with Two Players. ISCO 2022: 159-171 - [i9]Joran van den Bosse, Marc Uetz, Matthias Walter:
Exact Price of Anarchy for Weighted Congestion Games with Two Players. CoRR abs/2203.01740 (2022) - 2021
- [j28]Arjan Akkermans, Gerhard Post
Solving the shift and break design problem using integer linear programming. Ann. Oper. Res. 302(2): 341-362 (2021) - [j27]Varun Gupta
Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 46(3): 1230-1234 (2021) - 2020
- [j26]Jasper de Jong, Marc Uetz
The quality of equilibria for set packing and throughput scheduling games. Int. J. Game Theory 49(1): 321-344 (2020) - [j25]Varun Gupta
Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling. Math. Oper. Res. 45(2): 497-516 (2020) - [j24]Guangjing Yang, Hao Sun, Marc Uetz:
Cooperative sequencing games with position-dependent learning effect. Oper. Res. Lett. 48(4): 428-434 (2020)
2010 – 2019
- 2019
- [j23]Ruben Hoeksma
The price of anarchy for utilitarian scheduling games on related machines. Discret. Optim. 31: 29-39 (2019) - [j22]José Correa
The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing. Math. Oper. Res. 44(4): 1286-1303 (2019) - [j21]Jasper de Jong, Marc Uetz:
The sequential price of anarchy for affine congestion games with few players. Oper. Res. Lett. 47(2): 133-139 (2019) - 2017
- [c28]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. IPCO 2017: 228-240 - [c27]Jasper de Jong, Walter Kern, Berend Steenhuisen, Marc Uetz:
The Asymptotic Price of Anarchy for k-uniform Congestion Games. WAOA 2017: 317-328 - [i8]Varun Gupta, Benjamin Moseley, Marc Uetz, Qiaomin Xie:
Stochastic Online Scheduling on Unrelated Machines. CoRR abs/1703.01634 (2017) - [i7]Jasper de Jong, Marc Uetz:
The Quality of Equilibria for Set Packing Games. CoRR abs/1709.10289 (2017) - 2016
- [j20]Ruben Hoeksma
Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope. Discret. Appl. Math. 215: 136-145 (2016) - [j19]Ruben Hoeksma
Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types. Oper. Res. 64(6): 1438-1450 (2016) - [j18]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Unrelated Machine Scheduling with Stochastic Processing Times. Math. Oper. Res. 41(3): 851-864 (2016) - [c26]Jasper de Jong, Max Klimm, Marc Uetz:
Efficiency of Equilibria in Uniform Matroid Congestion Games. SAGT 2016: 105-116 - [i6]Walter Kern, Bodo Manthey, Marc Uetz:
Note on VCG vs. Price Raising for Matching Markets. CoRR abs/1604.04157 (2016) - 2015
- [j17]Jelle Duives, Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
On optimal mechanism design for a sequencing problem. J. Sched. 18(1): 45-59 (2015) - [c25]José Correa, Jasper de Jong, Bart de Keijzer, Marc Uetz:
The Curse of Sequentiality in Routing Games. WINE 2015: 258-271 - [p1]Rudolf Müller, Marc Uetz:
Shortest Path to Mechanism Design. Gems of Combinatorial Optimization and Graph Algorithms 2015: 83-94 - 2014
- [c24]Ruben Hoeksma
Decomposition Algorithm for the Single Machine Scheduling Polytope. ISCO 2014: 280-291 - [c23]Martin Skutella, Maxim Sviridenko, Marc Uetz:
Stochastic Scheduling on Unrelated Machines. STACS 2014: 639-650 - [c22]Jasper de Jong, Marc Uetz:
The Sequential Price of Anarchy for Atomic Congestion Games. WINE 2014: 429-434 - 2013
- [j16]Caroline J. Jagtenberg
Analysis of Smith's rule in stochastic machine scheduling. Oper. Res. Lett. 41(6): 570-575 (2013) - [c21]Jasper de Jong, Marc Uetz, Andreas Wombacher:
Decentralized Throughput Scheduling. CIAC 2013: 134-145 - [c20]Ruben Hoeksma
Two Dimensional Optimal Mechanism Design for a Sequencing Problem. IPCO 2013: 242-253 - [i5]Ruben Hoeksma, Marc Uetz:
Two-dimensional optimal mechanism design for a single machine scheduling problem. CTW 2013: 125-127 - 2011
- [j15]Alexander Grigoriev
On the complexity of a bundle pricing problem. 4OR 9(3): 255-260 (2011) - [c19]Ruben Hoeksma
The Price of Anarchy for Minsum Related Machine Scheduling. WAOA 2011: 261-273 - 2010
- [j14]Birgit Heydenreich, Rudolf Müller, Marc Uetz:
Mechanism Design for Decentralized Online Machine Scheduling. Oper. Res. 58(2): 445-457 (2010) - [c18]Alexander Grigoriev
On the Complexity of the Highway Pricing Problem. SOFSEM 2010: 465-476 - [c17]Caroline J. Jagtenberg
Lower Bounds for Smith's Rule in Stochastic Machine Scheduling. WAOA 2010: 142-153 - [i4]Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
Optimal Mechanisms for Scheduling. Scheduling 2010
2000 – 2009
- 2009
- [j13]Alexander Grigoriev
Scheduling jobs with time-resource tradeoff via nonlinear programming. Discret. Optim. 6(4): 414-419 (2009) - [j12]Alexander Grigoriev
Optimal pricing of capacitated networks. Networks 53(1): 79-87 (2009) - 2008
- [j11]Alexander Grigoriev
Optimal bundle pricing with monotonicity constraint. Oper. Res. Lett. 36(5): 609-614 (2008) - [c16]Alexander Grigoriev
Algorithms for Optimal Price Regulations. WINE 2008: 362-373 - [c15]Birgit Heydenreich, Debasis Mishra, Rudolf Müller, Marc Uetz:
Optimal Mechanisms for Single Machine Scheduling. WINE 2008: 414-425 - 2007
- [j10]Alexander Grigoriev
Machine scheduling with resource dependent processing times. Math. Program. 110(1): 209-228 (2007) - [c14]Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - [c13]Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra:
On revenue equivalence in truthful mechanisms. CTW 2007: 69-72 - [c12]Alexander Grigoriev
Bundle Pricing with Comparable Items. ESA 2007: 475-486 - [i3]Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra:
On Revenue Equivalence in Truthful Mechanisms. Computational Social Systems and the Internet 2007 - 2006
- [j9]Nicole Megow
Models and Algorithms for Stochastic Online Scheduling. Math. Oper. Res. 31(3): 513-525 (2006) - [c11]Alexander Grigoriev
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. APPROX-RANDOM 2006: 140-151 - [c10]Birgit Heydenreich, Rudolf Müller, Marc Uetz:
Decentralization and Mechanism Design for Online Machine Scheduling. SWAT 2006: 136-147 - [c9]Alexander Grigoriev
How to Sell a Graph: Guidelines for Graph Retailers. WG 2006: 125-136 - [i2]Birgit Heydenreich, Rudolf Müller, Marc Uetz:
Decentralization and Mechanism Design for Online Machine Scheduling. Negotiation and Market Engineering 2006 - 2005
- [j8]Frederik Stork, Marc Uetz:
On the generation of circuits and minimal forbidden sets. Math. Program. 102(1): 185-203 (2005) - [j7]Frederik Stork, Marc Uetz:
On the generation of circuits and minimal forbidden sets. Math. Program. 102(1): 205 (2005) - [j6]Martin Skutella, Marc Uetz:
Stochastic Machine Scheduling with Precedence Constraints. SIAM J. Comput. 34(4): 788-802 (2005) - [c8]Herman Sontrop, Pieter van der Horn, Marc Uetz:
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows. Hybrid Metaheuristics 2005: 78-89 - [c7]Alexander Grigoriev
Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. IPCO 2005: 182-195 - [c6]Alexander Grigoriev
Scheduling Parallel Jobs with Linear Speedup. WAOA 2005: 203-215 - [i1]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. Algorithms for Optimization with Incomplete Information 2005 - 2004
- [c5]Alexander Grigoriev
Pricing Network Edges to Cross a River. WAOA 2004: 140-153 - [c4]Nicole Megow, Marc Uetz, Tjark Vredeveld:
Stochastic Online Scheduling on Parallel Machines. WAOA 2004: 167-180 - 2003
- [j5]Frederik Stork, Marc Uetz:
Enumeration of Circuits and Minimal Forbidden Sets. Electron. Notes Discret. Math. 13: 108-111 (2003) - [j4]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Solving Project Scheduling Problems by Minimum Cut Computations. Manag. Sci. 49(3): 330-350 (2003) - [j3]Marc Uetz:
When greediness fails: examples from stochastic scheduling. Oper. Res. Lett. 31(3): 413-419 (2003) - 2001
- [j2]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
On project scheduling with irregular starting time costs. Oper. Res. Lett. 28(4): 149-154 (2001) - [c3]Martin Skutella, Marc Uetz:
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines. SODA 2001: 589-590
1990 – 1999
- 1999
- [j1]Rolf H. Möhring, Andreas S. Schulz
Approximation in stochastic scheduling: the power of LP-based priority policies. J. ACM 46(6): 924-942 (1999) - [c2]Rolf H. Möhring, Andreas S. Schulz, Frederik Stork, Marc Uetz:
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems. ESA 1999: 139-150 - [c1]Rolf H. Möhring, Andreas S. Schulz, Marc Uetz:
Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies. RANDOM-APPROX 1999: 144-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: