default search action
Florian Schoppmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j4]Tim Roughgarden, Florian Schoppmann:
Local smoothness and the price of anarchy in splittable congestion games. J. Econ. Theory 156: 317-342 (2015) - 2012
- [j3]Joseph M. Hellerstein, Christopher Ré, Florian Schoppmann, Daisy Zhe Wang, Eugene Fratkin, Aleksander Gorajek, Kee Siong Ng
, Caleb Welton, Xixuan Feng, Kun Li, Arun Kumar:
The MADlib Analytics Library or MAD Skills, the SQL. Proc. VLDB Endow. 5(12): 1700-1711 (2012) - [i1]Joseph M. Hellerstein, Christopher Ré, Florian Schoppmann, Daisy Zhe Wang, Eugene Fratkin, Aleksander Gorajek, Kee Siong Ng, Caleb Welton, Xixuan Feng, Kun Li, Arun Kumar:
The MADlib Analytics Library or MAD Skills, the SQL. CoRR abs/1208.4165 (2012) - 2011
- [j2]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. SIAM J. Comput. 40(5): 1211-1233 (2011) - [c10]Tim Roughgarden, Florian Schoppmann:
Local Smoothness and the Price of Anarchy in Atomic Splittable Congestion Games. SODA 2011: 255-267
2000 – 2009
- 2009
- [b1]Florian Schoppmann:
Collusion-resistant cost-sharing mechanisms: design techniques, analyses, trade-offs. Paderborn University, Germany, 2009 - [c9]Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer:
Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267 - 2008
- [j1]Yvonne Bleischwitz, Florian Schoppmann:
New efficiency results for makespan cost sharing. Inf. Process. Lett. 107(2): 64-70 (2008) - [c8]Marios Mavronicolas
Voronoi Games on Cycle Graphs. MFCS 2008: 503-514 - [c7]Yvonne Bleischwitz, Florian Schoppmann:
Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location. SAGT 2008: 350-361 - [c6]Florian Schoppmann:
The Power of Small Coalitions in Cost Sharing. WINE 2008: 665-674 - 2007
- [c5]Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann, Karsten Tiemann:
The Power of Two Prices: Beyond Cross-Monotonicity. MFCS 2007: 657-668 - [c4]Martin Gairing, Florian Schoppmann:
Total Latency in Singleton Congestion Games. WINE 2007: 381-387 - [c3]Yvonne Bleischwitz, Burkhard Monien, Florian Schoppmann:
To Be or Not to Be (Served). WINE 2007: 515-528 - 2006
- [c2]Sebastian Aland, Dominic Dumrauf, Martin Gairing, Burkhard Monien, Florian Schoppmann:
Exact Price of Anarchy for Polynomial Congestion Games. STACS 2006: 218-229 - [c1]Vladimir V. Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann:
Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic. WINE 2006: 331-342
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-08-05 20:18 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: