default search action
Matthias Feldotto
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [b1]Matthias Feldotto:
Approximate pure nash equilibria in congestion, opinion formation and facility location games. Paderborn University, Germany, 2019 - [j3]Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2): 620-638 (2019) - [c15]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. AAMAS 2019: 1949-1951 - [i7]Matthias Feldotto, Pascal Lenzner, Louise Molitor, Alexander Skopalik:
From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation. CoRR abs/1903.04265 (2019) - 2018
- [j2]Matthias Feldotto
, Lennart Leder, Alexander Skopalik:
Congestion games with mixed objectives. J. Comb. Optim. 36(4): 1145-1167 (2018) - [c14]Björn Feldkord, Matthias Feldotto, Anupam Gupta, Guru Guruganesh, Amit Kumar
Fully-Dynamic Bin Packing with Little Repacking. ICALP 2018: 51:1-51:24 - [c13]Matthias Feldotto, Claus-Jochen Haake, Alexander Skopalik, Nadja Stroh-Maraun:
Disaggregating User Evaluations Using the Shapley Value. NetEcon@SIGMETRICS 2018: 5:1-5:6 - 2017
- [c12]Matthias Feldotto
Congestion Games with Complementarities. CIAC 2017: 222-233 - [c11]Maximilian Drees, Matthias Feldotto
Pure Nash Equilibria in Restricted Budget Games. COCOON 2017: 175-187 - [c10]Matthias Feldotto
Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App. DESRIST 2017: 462-467 - [c9]Thomas John, Matthias Feldotto, Paul Hemsen, Katrin Klingsieck, Dennis Kundisch, Mike Langendorf:
Towards a Lean Approach to Gamifying Education. ECIS 2017 - [c8]Matthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik:
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. WINE 2017: 191-204 - [i6]Matthias Feldotto
Congestion Games with Complementarities. CoRR abs/1701.07304 (2017) - [i5]Matthias Feldotto
Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games. CoRR abs/1710.01634 (2017) - [i4]Björn Feldkord, Matthias Feldotto, Sören Riechers:
A Tight Approximation for Fully Dynamic Bin Packing without Bundling. CoRR abs/1711.01231 (2017) - 2016
- [j1]Matthias Feldotto
Systematic evaluation of peer-to-peer systems using PeerfactSim.KOM. Concurr. Comput. Pract. Exp. 28(5): 1655-1677 (2016) - [c7]Matthias Feldotto
Congestion Games with Mixed Objectives. COCOA 2016: 655-669 - [i3]Matthias Feldotto
Congestion Games with Mixed Objectives. CoRR abs/1607.05143 (2016) - 2015
- [c6]Maximilian Drees, Matthias Feldotto
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. SAGT 2015: 178-189 - [i2]Maximilian Drees, Matthias Feldotto
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. CoRR abs/1507.02908 (2015) - 2014
- [c5]Matthias Feldotto
HSkip+: A self-stabilizing overlay network for nodes with heterogeneous bandwidths. P2P 2014: 1-10 - [c4]Matthias Feldotto, Alexander Skopalik:
A simulation framework for analyzing complex infinitely repeated games. SIMULTECH 2014: 625-630 - [c3]Matthias Feldotto
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria. WINE 2014: 30-43 - [i1]Matthias Feldotto
HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. CoRR abs/1408.0395 (2014) - 2013
- [c2]Matthias Feldotto
Comparative evaluation of peer-to-peer systems using PeerfactSim.KOM. HPCS 2013: 99-106 - [c1]Stefan Böttcher, Matthias Feldotto, Rita Hartel:
Schema-based Parallel Compression and Decompression of XML Data. WEBIST 2013: 77-86
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-05-08 21:53 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: