Maximilian Drees

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Matthias Feldotto

> Home > Persons > Maximilian Drees

Publications

2019
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/DreesFRS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/DreesFRS19
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash equilibria in restricted budget games. J. Comb. Optim. 37(2): 620-638 (2019)
2017
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/DreesFRS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/DreesFRS17
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
Pure Nash Equilibria in Restricted Budget Games. COCOON 2017: 175-187
2015
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/sagt/DreesFRS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sagt/DreesFRS15
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. SAGT 2015: 178-189
[i2]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/DreesFRS15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/DreesFRS15
Maximilian Drees, Matthias Feldotto, Sören Riechers, Alexander Skopalik:
On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games. CoRR abs/1507.02908 (2015)

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.