default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Schröder 0002
Person information
- affiliation: Maastricht University, The Netherlands
- affiliation (former): RWTH Aachen University, Management Science, Germany
- affiliation (former): Maastricht University, The Netherlands
Other persons with the same name
- Marc Schröder 0001 — German Research Centre for Artificial Intelligence (DFKI), Saarbrücken, Germany
- Marc Schröder 0003
![[0000-0002-9693-7812]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-9693-7812")
— Deutscher Wetterdienst, Offenbach, Germany - Marc Schröder 0004 — NOVA University Lisbon, Portugal
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Tom McGrath, Marc Schröder:
Competitive secretary problem. Int. J. Game Theory 54(1): 1 (2025)- 2024
- [j14]Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir:
Minimizing total completion time with machine-dependent priority lists. Eur. J. Oper. Res. 315(3): 844-854 (2024) - [j13]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash flows over time. Games Econ. Behav. 147: 19-37 (2024) - [i12]André Berger, Arman Rouhani, Marc Schröder:
An improved bound for the price of anarchy for related machine scheduling. CoRR abs/2401.05740 (2024) - [i11]Gaëtan Fournier, Marc Schröder:
Popularity in location games. CoRR abs/2401.07732 (2024) - [i10]André Berger, Arman Rouhani, Marc Schröder:
Fixed Order Scheduling with Deadlines. CoRR abs/2412.10760 (2024) - 2023
- [j12]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Approximation and Convergence of Large Atomic Congestion Games. Math. Oper. Res. 48(2): 784-811 (2023) - 2022
- [j11]Daniel Schmand, Marc Schröder, Laura Vargas Koch:
A greedy algorithm for the social golfer and the Oberwolfach problem. Eur. J. Oper. Res. 300(1): 310-319 (2022) - [j10]José Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder:
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. Oper. Res. 70(1): 472-489 (2022) - [j9]Karsten Jungnitsch, Britta Peis, Marc Schröder:
Stackelberg Max Closure with Multiple Followers. Math. Oper. Res. 47(4): 3010-3024 (2022) - [j8]Andrés Cristi, Marc Schröder:
Negative prices in network pricing games. Oper. Res. Lett. 50(2): 99-106 (2022) - [c7]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. WINE 2022: 368 - 2021
- [j7]Vipin Ravindran Vijayalakshmi, Marc Schröder, Tami Tamir:
Scheduling games with machine-dependent priority lists. Theor. Comput. Sci. 855: 90-103 (2021) - [i9]Tim Oosterwijk, Daniel Schmand, Marc Schröder:
Bicriteria Nash Flows over Time. CoRR abs/2111.08589 (2021) - 2020
- [c6]Marc Schröder:
Price of Anarchy in Congestion Games with Altruistic/Spiteful Players. SAGT 2020: 146-159 - [i8]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Convergence of Large Atomic Congestion Games. CoRR abs/2001.02797 (2020) - [i7]Daniel Schmand, Marc Schröder, Laura Vargas Koch:
A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem. CoRR abs/2007.10704 (2020)
2010 – 2019
- 2019
- [j6]Tobias Harks, Marc Schröder, Dries Vermeulen:
Toll caps in privatized road networks. Eur. J. Oper. Res. 276(3): 947-956 (2019) - [j5]Hans Peters, Marc Schröder, Dries Vermeulen:
Claim games for estate division problems. Games Econ. Behav. 116: 105-115 (2019) - [c5]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. EC 2019: 579-580 - [c4]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Games with Wardrop Followers. ICALP 2019: 151:1-151:14 - [c3]Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi:
Scheduling Games with Machine-Dependent Priority Lists. WINE 2019: 286-300 - [i6]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. CoRR abs/1903.03309 (2019) - [i5]Andrés Cristi, Marc Schröder:
Negative Prices in Network Pricing Games. CoRR abs/1904.08884 (2019) - [i4]Daniel Schmand, Marc Schröder, Alexander Skopalik:
Network Investment Game with Wardrop Followers. CoRR abs/1904.10417 (2019) - [i3]Marc Schröder, Tami Tamir, Vipin Ravindran Vijayalakshmi:
Scheduling Games with Machine-Dependent Priority Lists. CoRR abs/1909.10199 (2019) - 2018
- [j4]Hans Peters, Marc Schröder, Dries Vermeulen:
Hotelling's location model with negative network externalities. Int. J. Game Theory 47(3): 811-837 (2018) - [j3]Marco Scarsini, Marc Schröder, Tristan Tomala:
Dynamic Atomic Congestion Games with Seasonal Flows. Oper. Res. 66(2): 327-339 (2018) - [c2]José Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder:
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. EC 2018: 375-392 - [i2]Tobias Harks, Marc Schröder, Dries Vermeulen:
Toll Caps in Privatized Road Networks. CoRR abs/1802.10514 (2018) - 2017
- [c1]José Correa, Ruben Hoeksma, Marc Schröder:
Network Congestion Games Are Robust to Variable Demand. WINE 2017: 397 - 2016
- [j2]János Flesch, Marc Schröder, Dries Vermeulen:
Implementable and ex-post IR rules in bilateral trading with discrete values. Math. Soc. Sci. 84: 68-75 (2016) - [i1]Marco Scarsini, Marc Schröder, Tristan Tomala:
Dynamic Atomic Congestion Games with Seasonal Flows. CoRR abs/1606.05691 (2016) - 2015
- [j1]Hans Peters, Marc Schröder, Dries Vermeulen:
On existence of ex post Nash consistent representation for effectivity functions. Soc. Choice Welf. 45(2): 287-307 (2015)
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 2025-03-04 22:09 CET 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:
