Marc Uetz

Orcid: 0000-0003-4223-2435

According to our database1, Marc Uetz authored at least 69 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Stochastic Minimum Spanning Trees with a Single Sample.
CoRR, 2024

Price of Anarchy for Graphic Matroid Congestion Games.
Proceedings of the Algorithmic Game Theory - 17th International Symposium, 2024

Sequencing Stochastic Jobs with a Single Sample.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024

Equilibria in Two-Stage Facility Location with Atomic Clients.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
Two-step Shapley-solidarity value for cooperative games with coalition structure.
OR Spectr., March, 2023

Algorithmic Solutions for Maximizing Shareable Costs.
CoRR, 2023

2022
In memoriam Gerhard Woeginger.
Oper. Res. Lett., 2022

Power surplus solutions for weighted hypergraph communication situations.
Int. Trans. Oper. Res., 2022

Exact Price of Anarchy for Weighted Congestion Games with Two Players.
Proceedings of the Combinatorial Optimization - 7th International Symposium, 2022

2021
Corrigendum: Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.
Math. Oper. Res., 2021

Solving the shift and break design problem using integer linear programming.
Ann. Oper. Res., 2021

2020
Cooperative sequencing games with position-dependent learning effect.
Oper. Res. Lett., 2020

Greed Works - Online Algorithms for Unrelated Machine Stochastic Scheduling.
Math. Oper. Res., 2020

The quality of equilibria for set packing and throughput scheduling games.
Int. J. Game Theory, 2020

2019
The sequential price of anarchy for affine congestion games with few players.
Oper. Res. Lett., 2019

The Inefficiency of Nash and Subgame Perfect Equilibria for Network Routing.
Math. Oper. Res., 2019

The price of anarchy for utilitarian scheduling games on related machines.
Discret. Optim., 2019

2017
The Quality of Equilibria for Set Packing Games.
CoRR, 2017

The Asymptotic Price of Anarchy for k-uniform Congestion Games.
Proceedings of the Approximation and Online Algorithms - 15th International Workshop, 2017

Stochastic Online Scheduling on Unrelated Machines.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016
Unrelated Machine Scheduling with Stochastic Processing Times.
Math. Oper. Res., 2016

Optimal Mechanism Design for a Sequencing Problem with Two-Dimensional Types.
Oper. Res., 2016

Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope.
Discret. Appl. Math., 2016

Note on VCG vs. Price Raising for Matching Markets.
CoRR, 2016

Efficiency of Equilibria in Uniform Matroid Congestion Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
On optimal mechanism design for a sequencing problem.
J. Sched., 2015

The Curse of Sequentiality in Routing Games.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

Shortest Path to Mechanism Design.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
The Sequential Price of Anarchy for Atomic Congestion Games.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Stochastic Scheduling on Unrelated Machines.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Decomposition Algorithm for the Single Machine Scheduling Polytope.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Analysis of Smith's rule in stochastic machine scheduling.
Oper. Res. Lett., 2013

Two Dimensional Optimal Mechanism Design for a Sequencing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

Two-dimensional optimal mechanism design for a single machine scheduling problem.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

Decentralized Throughput Scheduling.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2011
On the complexity of a bundle pricing problem.
4OR, 2011

The Price of Anarchy for Minsum Related Machine Scheduling.
Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

2010
Mechanism Design for Decentralized Online Machine Scheduling.
Oper. Res., 2010

Lower Bounds for Smith's Rule in Stochastic Machine Scheduling.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

On the Complexity of the Highway Pricing Problem.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Optimal Mechanisms for Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009
Optimal pricing of capacitated networks.
Networks, 2009

Scheduling jobs with time-resource tradeoff via nonlinear programming.
Discret. Optim., 2009

2008
Optimal bundle pricing with monotonicity constraint.
Oper. Res. Lett., 2008

Optimal Mechanisms for Single Machine Scheduling.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Algorithms for Optimal Price Regulations.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
Machine scheduling with resource dependent processing times.
Math. Program., 2007

Bundle Pricing with Comparable Items.
Proceedings of the Algorithms, 2007

On revenue equivalence in truthful mechanisms.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

Optimal bundle pricing for homogeneous items.
Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006
Models and Algorithms for Stochastic Online Scheduling.
Math. Oper. Res., 2006

How to Sell a Graph: Guidelines for Graph Retailers.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Decentralization and Mechanism Design for Online Machine Scheduling.
Proceedings of the Algorithm Theory, 2006

LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times.
Proceedings of the Approximation, 2006

2005
Stochastic Machine Scheduling with Precedence Constraints.
SIAM J. Comput., 2005

On the generation of circuits and minimal forbidden sets.
Math. Program., 2005

Scheduling Parallel Jobs with Linear Speedup.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows.
Proceedings of the Hybrid Metaheuristics, Second International Workshop, 2005

2004
Stochastic Online Scheduling on Parallel Machines.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Pricing Network Edges to Cross a River.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003
When greediness fails: examples from stochastic scheduling.
Oper. Res. Lett., 2003

Solving Project Scheduling Problems by Minimum Cut Computations.
Manag. Sci., 2003

Enumeration of Circuits and Minimal Forbidden Sets.
Electron. Notes Discret. Math., 2003

2001
On project scheduling with irregular starting time costs.
Oper. Res. Lett., 2001

Scheduling precedence-constrained jobs with stochastic processing times on parallel machines.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1999
Approximation in stochastic scheduling: the power of LP-based priority policies.
J. ACM, 1999

Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies.
Proceedings of the Randomization, 1999

Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.
Proceedings of the Algorithms, 1999


  Loading...