---
_id: '563'
abstract:
- lang: eng
  text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc
    networks. Such backbones receive and transmit messages from/to every node in the
    network. Existing distributed algorithms only consider undirected graphs, which
    model symmetric networks with uniform transmission ranges. We are particularly
    interested in the well-established disk graphs, which model asymmetric networks
    with non-uniform transmission ranges. The corresponding graph theoretic problem
    seeks a strongly connected dominating-absorbent set of minimum cardinality in
    a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent
    set if the subgraph induced by these nodes is strongly connected and each node
    in the graph is either in the set or has both an in-neighbor and an out-neighbor
    in it. We introduce the first distributed algorithm for this problem in disk graphs.
    The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of
    O(Diam) where Diam is the diameter of the graph and k denotes the transmission
    ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission
    range, respectively. Moreover, we apply our algorithm on the subgraph of disk
    graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k)
    -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k ,
    is an optimal approximation for the problem, following Lenzen and Wattenhofer’s
    Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk
    graphs.
author:
- first_name: Christine
  full_name: Markarian, Christine
  id: '37612'
  last_name: Markarian
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Michael
  full_name: Schubert, Michael
  last_name: Schubert
citation:
  ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation
    Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
    Ad-Hoc Networks. In: <i>Proceedings of the 9th International Symposium on Algorithms
    and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
    (ALGOSENSORS)</i>. LNCS. ; 2013:217-227. doi:<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>'
  apa: Markarian, C., Meyer auf der Heide, F., &#38; Schubert, M. (2013). A Distributed
    Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
    Wireless Ad-Hoc Networks. In <i>Proceedings of the 9th International Symposium
    on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
    Robotics (ALGOSENSORS)</i> (pp. 217–227). <a href="https://doi.org/10.1007/978-3-642-45346-5_16">https://doi.org/10.1007/978-3-642-45346-5_16</a>
  bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS},
    title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
    Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>},
    booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments
    for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)},
    author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
    Michael}, year={2013}, pages={217–227}, collection={LNCS} }'
  chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert.
    “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
    Sets in Asymmetric Wireless Ad-Hoc Networks.” In <i>Proceedings of the 9th International
    Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
    and Distributed Robotics (ALGOSENSORS)</i>, 217–27. LNCS, 2013. <a href="https://doi.org/10.1007/978-3-642-45346-5_16">https://doi.org/10.1007/978-3-642-45346-5_16</a>.
  ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation
    Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
    Ad-Hoc Networks,” in <i>Proceedings of the 9th International Symposium on Algorithms
    and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
    (ALGOSENSORS)</i>, 2013, pp. 217–227.
  mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly
    Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” <i>Proceedings
    of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
    Wireless Networks and Distributed Robotics (ALGOSENSORS)</i>, 2013, pp. 217–27,
    doi:<a href="https://doi.org/10.1007/978-3-642-45346-5_16">10.1007/978-3-642-45346-5_16</a>.
  short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the
    9th International Symposium on Algorithms and Experiments for Sensor Systems,
    Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:13Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:25:15Z
  date_updated: 2018-03-15T10:25:15Z
  file_id: '1278'
  file_name: 563-978-3-642-45346-5_16.pdf
  file_size: 348191
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:25:15Z
has_accepted_license: '1'
page: 217-227
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Symposium on Algorithms and Experiments
  for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
series_title: LNCS
status: public
title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
  Sets in Asymmetric Wireless Ad-Hoc Networks
type: conference
user_id: '477'
year: '2013'
...
---
_id: '564'
abstract:
- lang: eng
  text: We consider the problem of resource discovery in distributed systems. In particular
    we give an algorithm, such that each node in a network discovers the add ress
    of any other node in the network. We model the knowledge of the nodes as a virtual
    overlay network given by a directed graph such that complete knowledge of all
    nodes corresponds to a complete graph in the overlay network. Although there are
    several solutions for resource discovery, our solution is the first that achieves
    worst-case optimal work for each node, i.e. the number of addresses (O(n)) or
    bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while
    ensuring only a linearruntime (O(n)) on the number of rounds.
author:
- first_name: Sebastian
  full_name: Kniesburges, Sebastian
  last_name: Kniesburges
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message
    Complexity Optimal Solution for Resource Discovery. In: <i>Proceedings of 20th
    International Colloqium on Structural Information and Communication Complexity
    (SIROCCO)</i>. Lecture Notes in Computer Science. ; 2013:165-176. doi:<a href="https://doi.org/10.1007/978-3-319-03578-9_14">10.1007/978-3-319-03578-9_14</a>'
  apa: Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). A Deterministic
    Worst-Case Message Complexity Optimal Solution for Resource Discovery. In <i>Proceedings
    of 20th International Colloqium on Structural Information and Communication Complexity
    (SIROCCO)</i> (pp. 165–176). <a href="https://doi.org/10.1007/978-3-319-03578-9_14">https://doi.org/10.1007/978-3-319-03578-9_14</a>
  bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture
    Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity
    Optimal Solution for Resource Discovery}, DOI={<a href="https://doi.org/10.1007/978-3-319-03578-9_14">10.1007/978-3-319-03578-9_14</a>},
    booktitle={Proceedings of 20th International Colloqium on Structural Information
    and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos,
    Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture
    Notes in Computer Science} }'
  chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler.
    “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”
    In <i>Proceedings of 20th International Colloqium on Structural Information and
    Communication Complexity (SIROCCO)</i>, 165–76. Lecture Notes in Computer Science,
    2013. <a href="https://doi.org/10.1007/978-3-319-03578-9_14">https://doi.org/10.1007/978-3-319-03578-9_14</a>.
  ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case
    Message Complexity Optimal Solution for Resource Discovery,” in <i>Proceedings
    of 20th International Colloqium on Structural Information and Communication Complexity
    (SIROCCO)</i>, 2013, pp. 165–176.
  mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity
    Optimal Solution for Resource Discovery.” <i>Proceedings of 20th International
    Colloqium on Structural Information and Communication Complexity (SIROCCO)</i>,
    2013, pp. 165–76, doi:<a href="https://doi.org/10.1007/978-3-319-03578-9_14">10.1007/978-3-319-03578-9_14</a>.
  short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th
    International Colloqium on Structural Information and Communication Complexity
    (SIROCCO), 2013, pp. 165–176.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-03578-9_14
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:24:40Z
  date_updated: 2018-03-15T10:24:40Z
  file_id: '1277'
  file_name: 564-SIROCCO13.pdf
  file_size: 168884
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:24:40Z
has_accepted_license: '1'
page: 165-176
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of 20th International Colloqium on Structural Information
  and Communication Complexity (SIROCCO)
series_title: Lecture Notes in Computer Science
status: public
title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource
  Discovery
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '2519'
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Jan Thomas
  full_name: Martini, Jan Thomas
  last_name: Martini
citation:
  ama: Haake C-J, Martini JT. Negotiating Transfer Prices. <i>Group Decision and Negotiation</i>.
    2012;22(4):657-680. doi:<a href="https://doi.org/10.1007/s10726-012-9286-6">10.1007/s10726-012-9286-6</a>
  apa: Haake, C.-J., &#38; Martini, J. T. (2012). Negotiating Transfer Prices. <i>Group
    Decision and Negotiation</i>, <i>22</i>(4), 657–680. <a href="https://doi.org/10.1007/s10726-012-9286-6">https://doi.org/10.1007/s10726-012-9286-6</a>
  bibtex: '@article{Haake_Martini_2012, title={Negotiating Transfer Prices}, volume={22},
    DOI={<a href="https://doi.org/10.1007/s10726-012-9286-6">10.1007/s10726-012-9286-6</a>},
    number={4}, journal={Group Decision and Negotiation}, publisher={Springer Nature},
    author={Haake, Claus-Jochen and Martini, Jan Thomas}, year={2012}, pages={657–680}
    }'
  chicago: 'Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.”
    <i>Group Decision and Negotiation</i> 22, no. 4 (2012): 657–80. <a href="https://doi.org/10.1007/s10726-012-9286-6">https://doi.org/10.1007/s10726-012-9286-6</a>.'
  ieee: C.-J. Haake and J. T. Martini, “Negotiating Transfer Prices,” <i>Group Decision
    and Negotiation</i>, vol. 22, no. 4, pp. 657–680, 2012.
  mla: Haake, Claus-Jochen, and Jan Thomas Martini. “Negotiating Transfer Prices.”
    <i>Group Decision and Negotiation</i>, vol. 22, no. 4, Springer Nature, 2012,
    pp. 657–80, doi:<a href="https://doi.org/10.1007/s10726-012-9286-6">10.1007/s10726-012-9286-6</a>.
  short: C.-J. Haake, J.T. Martini, Group Decision and Negotiation 22 (2012) 657–680.
date_created: 2018-04-26T10:49:51Z
date_updated: 2022-01-06T06:56:54Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s10726-012-9286-6
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T09:59:39Z
  date_updated: 2018-08-09T09:59:39Z
  file_id: '3870'
  file_name: Negotiating Transfer Prices.pdf
  file_size: 407410
  relation: main_file
  success: 1
file_date_updated: 2018-08-09T09:59:39Z
has_accepted_license: '1'
intvolume: '        22'
issue: '4'
language:
- iso: eng
page: 657-680
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: Group Decision and Negotiation
publication_identifier:
  issn:
  - 0926-2644
  - 1572-9907
publication_status: published
publisher: Springer Nature
status: public
title: Negotiating Transfer Prices
type: journal_article
user_id: '65453'
volume: 22
year: '2012'
...
---
_id: '2521'
author:
- first_name: Claus-Jochen
  full_name: Haake, Claus-Jochen
  id: '20801'
  last_name: Haake
- first_name: Tim
  full_name: Krieger, Tim
  last_name: Krieger
- first_name: Steffen
  full_name: Minter, Steffen
  last_name: Minter
citation:
  ama: Haake C-J, Krieger T, Minter S. On the institutional design of burden sharing
    when financing external border enforcement in the EU. <i>International Economics
    and Economic Policy</i>. 2012;10(4):583-612. doi:<a href="https://doi.org/10.1007/s10368-012-0226-3">10.1007/s10368-012-0226-3</a>
  apa: Haake, C.-J., Krieger, T., &#38; Minter, S. (2012). On the institutional design
    of burden sharing when financing external border enforcement in the EU. <i>International
    Economics and Economic Policy</i>, <i>10</i>(4), 583–612. <a href="https://doi.org/10.1007/s10368-012-0226-3">https://doi.org/10.1007/s10368-012-0226-3</a>
  bibtex: '@article{Haake_Krieger_Minter_2012, title={On the institutional design
    of burden sharing when financing external border enforcement in the EU}, volume={10},
    DOI={<a href="https://doi.org/10.1007/s10368-012-0226-3">10.1007/s10368-012-0226-3</a>},
    number={4}, journal={International Economics and Economic Policy}, publisher={Springer
    Nature}, author={Haake, Claus-Jochen and Krieger, Tim and Minter, Steffen}, year={2012},
    pages={583–612} }'
  chicago: 'Haake, Claus-Jochen, Tim Krieger, and Steffen Minter. “On the Institutional
    Design of Burden Sharing When Financing External Border Enforcement in the EU.”
    <i>International Economics and Economic Policy</i> 10, no. 4 (2012): 583–612.
    <a href="https://doi.org/10.1007/s10368-012-0226-3">https://doi.org/10.1007/s10368-012-0226-3</a>.'
  ieee: C.-J. Haake, T. Krieger, and S. Minter, “On the institutional design of burden
    sharing when financing external border enforcement in the EU,” <i>International
    Economics and Economic Policy</i>, vol. 10, no. 4, pp. 583–612, 2012.
  mla: Haake, Claus-Jochen, et al. “On the Institutional Design of Burden Sharing
    When Financing External Border Enforcement in the EU.” <i>International Economics
    and Economic Policy</i>, vol. 10, no. 4, Springer Nature, 2012, pp. 583–612, doi:<a
    href="https://doi.org/10.1007/s10368-012-0226-3">10.1007/s10368-012-0226-3</a>.
  short: C.-J. Haake, T. Krieger, S. Minter, International Economics and Economic
    Policy 10 (2012) 583–612.
date_created: 2018-04-26T10:51:03Z
date_updated: 2022-01-06T06:56:55Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s10368-012-0226-3
file:
- access_level: closed
  content_type: application/pdf
  creator: cjhaake
  date_created: 2018-08-09T10:01:16Z
  date_updated: 2018-08-09T10:01:16Z
  file_id: '3871'
  file_name: On the institutional design of burden sharing when financing external
    border enforcement in the EU.pdf
  file_size: 442955
  relation: main_file
  success: 1
file_date_updated: 2018-08-09T10:01:16Z
has_accepted_license: '1'
intvolume: '        10'
issue: '4'
language:
- iso: eng
page: 583-612
project:
- _id: '1'
  name: SFB 901
- _id: '2'
  name: SFB 901 - Project Area A
- _id: '7'
  name: SFB 901 - Subproject A3
publication: International Economics and Economic Policy
publication_identifier:
  issn:
  - 1612-4804
  - 1612-4812
publication_status: published
publisher: Springer Nature
status: public
title: On the institutional design of burden sharing when financing external border
  enforcement in the EU
type: journal_article
user_id: '65453'
volume: 10
year: '2012'
...
---
_id: '570'
abstract:
- lang: eng
  text: 'This article studies the construction of self-stabilizing topologies for
    distributed systems. While recent research has focused on chain topologies where
    nodes need to be linearized with respect to their identiers, we explore a natural
    and relevant 2-dimensional generalization. In particular, we present a local self-stabilizing
    algorithm DStab which is based on the concept of \local Delaunay graphs" and which
    forwards temporary edges in greedy fashion reminiscent of compass routing. DStab
    constructs a Delaunay graph from any initial connected topology and in a distributed
    manner in time O(n3) in the worst-case; if the initial network contains the Delaunay
    graph, the convergence time is only O(n) rounds. DStab also ensures that individual
    node joins and leaves aect a small part of the network only. Such self-stabilizing
    Delaunay networks have interesting applications and our construction gives insights
    into the necessary geometric reasoning that is required for higherdimensional
    linearization problems.Keywords: Distributed Algorithms, Topology Control, Social
    Networks'
author:
- first_name: Riko
  full_name: Jacob, Riko
  last_name: Jacob
- first_name: Stephan
  full_name: Ritscher, Stephan
  last_name: Ritscher
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Stefan
  full_name: Schmid, Stefan
  last_name: Schmid
citation:
  ama: 'Jacob R, Ritscher S, Scheideler C, Schmid S. Towards higher-dimensional topological
    self-stabilization: A distributed algorithm for Delaunay graphs. <i>Theoretical
    Computer Science</i>. 2012:137-148. doi:<a href="https://doi.org/10.1016/j.tcs.2012.07.029">10.1016/j.tcs.2012.07.029</a>'
  apa: 'Jacob, R., Ritscher, S., Scheideler, C., &#38; Schmid, S. (2012). Towards
    higher-dimensional topological self-stabilization: A distributed algorithm for
    Delaunay graphs. <i>Theoretical Computer Science</i>, 137–148. <a href="https://doi.org/10.1016/j.tcs.2012.07.029">https://doi.org/10.1016/j.tcs.2012.07.029</a>'
  bibtex: '@article{Jacob_Ritscher_Scheideler_Schmid_2012, title={Towards higher-dimensional
    topological self-stabilization: A distributed algorithm for Delaunay graphs},
    DOI={<a href="https://doi.org/10.1016/j.tcs.2012.07.029">10.1016/j.tcs.2012.07.029</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Jacob, Riko
    and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan}, year={2012},
    pages={137–148} }'
  chicago: 'Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid.
    “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm
    for Delaunay Graphs.” <i>Theoretical Computer Science</i>, 2012, 137–48. <a href="https://doi.org/10.1016/j.tcs.2012.07.029">https://doi.org/10.1016/j.tcs.2012.07.029</a>.'
  ieee: 'R. Jacob, S. Ritscher, C. Scheideler, and S. Schmid, “Towards higher-dimensional
    topological self-stabilization: A distributed algorithm for Delaunay graphs,”
    <i>Theoretical Computer Science</i>, pp. 137–148, 2012.'
  mla: 'Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization:
    A Distributed Algorithm for Delaunay Graphs.” <i>Theoretical Computer Science</i>,
    Elsevier, 2012, pp. 137–48, doi:<a href="https://doi.org/10.1016/j.tcs.2012.07.029">10.1016/j.tcs.2012.07.029</a>.'
  short: R. Jacob, S. Ritscher, C. Scheideler, S. Schmid, Theoretical Computer Science
    (2012) 137–148.
date_created: 2017-10-17T12:42:43Z
date_updated: 2022-01-06T07:02:36Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2012.07.029
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T10:16:20Z
  date_updated: 2018-03-15T10:16:20Z
  file_id: '1272'
  file_name: 570-Delaunay-Journal.pdf
  file_size: 250051
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T10:16:20Z
has_accepted_license: '1'
page: 137-148
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Towards higher-dimensional topological self-stabilization: A distributed algorithm
  for Delaunay graphs'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '574'
abstract:
- lang: eng
  text: 'We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm.
    Tiara is truly deterministic which allows it to achieve exact performance bounds.
    Tiara allows logarithmic searches and topology updates. It is based on a novel
    sparse 0-1 skip list. We then describe its extension to a ringed structure and
    to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization.'
author:
- first_name: Thomas
  full_name: Clouser, Thomas
  last_name: Clouser
- first_name: Mikhail
  full_name: Nesterenko, Mikhail
  last_name: Nesterenko
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic
    skip list and skip graph. <i>Theoretical Computer Science</i>. 2012:18-35. doi:<a
    href="https://doi.org/10.1016/j.tcs.2011.12.079">10.1016/j.tcs.2011.12.079</a>'
  apa: 'Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2012). Tiara: A self-stabilizing
    deterministic skip list and skip graph. <i>Theoretical Computer Science</i>, 18–35.
    <a href="https://doi.org/10.1016/j.tcs.2011.12.079">https://doi.org/10.1016/j.tcs.2011.12.079</a>'
  bibtex: '@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing
    deterministic skip list and skip graph}, DOI={<a href="https://doi.org/10.1016/j.tcs.2011.12.079">10.1016/j.tcs.2011.12.079</a>},
    journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser,
    Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35}
    }'
  chicago: 'Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara:
    A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer
    Science</i>, 2012, 18–35. <a href="https://doi.org/10.1016/j.tcs.2011.12.079">https://doi.org/10.1016/j.tcs.2011.12.079</a>.'
  ieee: 'T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing
    deterministic skip list and skip graph,” <i>Theoretical Computer Science</i>,
    pp. 18–35, 2012.'
  mla: 'Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List
    and Skip Graph.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 18–35,
    doi:<a href="https://doi.org/10.1016/j.tcs.2011.12.079">10.1016/j.tcs.2011.12.079</a>.'
  short: T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012)
    18–35.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1016/j.tcs.2011.12.079
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:09:29Z
  date_updated: 2018-03-15T09:09:29Z
  file_id: '1268'
  file_name: 574-tiara.pdf
  file_size: 315843
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:09:29Z
has_accepted_license: '1'
page: 18-35
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Theoretical Computer Science
publisher: Elsevier
status: public
title: 'Tiara: A self-stabilizing deterministic skip list and skip graph'
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '575'
author:
- first_name: Lars
  full_name: Bremer, Lars
  last_name: Bremer
citation:
  ama: Bremer L. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität
    Paderborn; 2012.
  apa: Bremer, L. (2012). <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>.
    Universität Paderborn.
  bibtex: '@book{Bremer_2012, title={Symbiotic Coupling of Peer-to-Peer and Cloud
    Systems}, publisher={Universität Paderborn}, author={Bremer, Lars}, year={2012}
    }'
  chicago: Bremer, Lars. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>.
    Universität Paderborn, 2012.
  ieee: L. Bremer, <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität
    Paderborn, 2012.
  mla: Bremer, Lars. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>.
    Universität Paderborn, 2012.
  short: L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems, Universität
    Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:38Z
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Symbiotic Coupling of Peer-to-Peer and Cloud Systems
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '578'
abstract:
- lang: eng
  text: 'This paper analyzes the stability of capital tax harmonization agreements
    in a stylized model where countries have formed coalitions which set a common
    tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium.
    In particular, for a given coalition structure we study to what extend the stability
    of tax agreements is affected by the coalitions that have formed. In our set-up,
    countries are symmetric, but coalitions can be of arbitrary size. We analyze stability
    by means of a repeated game setting employing simple trigger strategies and we
    allow a sub-coalition to deviate from the coalitional equilibrium. For a given
    form of punishment we are able to rank the stability of different coalition structures
    as long as the size of the largest coalition does not change. Our main results
    are: (1) singleton regions have the largest incentives to deviate, (2) the stability
    of cooperation depends on the degree of cooperative behavior ex-ante.'
author:
- first_name: Sonja
  full_name: Brangewitz, Sonja
  last_name: Brangewitz
- first_name: Sarah
  full_name: Brockhoff, Sarah
  last_name: Brockhoff
citation:
  ama: Brangewitz S, Brockhoff S. <i>Stability of Coalitional Equilibria within Repeated
    Tax Competition</i>. Universität Paderborn; 2012.
  apa: Brangewitz, S., &#38; Brockhoff, S. (2012). <i>Stability of Coalitional Equilibria
    within Repeated Tax Competition</i>. Universität Paderborn.
  bibtex: '@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria
    within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz,
    Sonja and Brockhoff, Sarah}, year={2012} }'
  chicago: Brangewitz, Sonja, and Sarah Brockhoff. <i>Stability of Coalitional Equilibria
    within Repeated Tax Competition</i>. Universität Paderborn, 2012.
  ieee: S. Brangewitz and S. Brockhoff, <i>Stability of Coalitional Equilibria within
    Repeated Tax Competition</i>. Universität Paderborn, 2012.
  mla: Brangewitz, Sonja, and Sarah Brockhoff. <i>Stability of Coalitional Equilibria
    within Repeated Tax Competition</i>. Universität Paderborn, 2012.
  short: S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated
    Tax Competition, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:44Z
date_updated: 2022-01-06T07:02:40Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:08:24Z
  date_updated: 2018-03-15T09:08:24Z
  file_id: '1267'
  file_name: 578-WP48Brangewitz.pdf
  file_size: 876927
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:08:24Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Stability of Coalitional Equilibria within Repeated Tax Competition
type: report
user_id: '477'
year: '2012'
...
---
_id: '579'
abstract:
- lang: eng
  text: A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number
    that is strictly larger than all preceding numbers. In this article we present
    a smoothed analysis of the number of left-to-right maxima in the presence of additive
    random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are
    perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right
    maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation
    σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis
    of the smoothed height of binary search trees and the smoothed number of comparisons
    in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε
    + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our
    results can also be applied to bound the smoothed number of points on a convex
    hull of points in the two-dimensional plane and to smoothed motion complexity,
    a concept we describe in this article. We bound how often one needs to update
    a data structure storing the smallest axis-aligned box enclosing a set of points
    moving in d-dimensional space.
author:
- first_name: Valentina
  full_name: Damerow, Valentina
  last_name: Damerow
- first_name: Bodo
  full_name: Manthey, Bodo
  last_name: Manthey
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Harald
  full_name: Räcke, Harald
  last_name: Räcke
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Christian
  full_name: Sohler, Christian
  last_name: Sohler
- first_name: Till
  full_name: Tantau, Till
  last_name: Tantau
citation:
  ama: Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right
    maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a
    href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>
  apa: Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C.,
    Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima
    with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href="https://doi.org/10.1145/2229163.2229174">https://doi.org/10.1145/2229163.2229174</a>
  bibtex: '@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012,
    title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>},
    number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow,
    Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald
    and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012},
    pages={30} }'
  chicago: 'Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald
    Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis
    of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>,
    no. 3 (2012): 30. <a href="https://doi.org/10.1145/2229163.2229174">https://doi.org/10.1145/2229163.2229174</a>.'
  ieee: V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with
    applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012.
  mla: Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with
    Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a
    href="https://doi.org/10.1145/2229163.2229174">10.1145/2229163.2229174</a>.
  short: V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler,
    C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:41Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1145/2229163.2229174
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T09:04:58Z
  date_updated: 2018-03-15T09:04:58Z
  file_id: '1266'
  file_name: 579-a30-damerow.pdf
  file_size: 329282
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T09:04:58Z
has_accepted_license: '1'
issue: '3'
page: '30'
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Transactions on Algorithms
publisher: ACM
status: public
title: Smoothed analysis of left-to-right maxima with applications
type: journal_article
user_id: '477'
year: '2012'
...
---
_id: '582'
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>.
    Universität Paderborn; 2012.
  apa: Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic
    Approach</i>. Universität Paderborn.
  bibtex: '@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim
    Frederik}, year={2012} }'
  chicago: Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach</i>. Universität Paderborn, 2012.
  ieee: T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic
    Approach</i>. Universität Paderborn, 2012.
  mla: Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game
    Theoretic Approach</i>. Universität Paderborn, 2012.
  short: T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:42Z
department:
- _id: '79'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Self-Optimizing Binary Search Trees - A Game Theoretic Approach
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '583'
author:
- first_name: Julian
  full_name: Drücker, Julian
  last_name: Drücker
citation:
  ama: Drücker J. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>.
    Universität Paderborn; 2012.
  apa: Drücker, J. (2012). <i>Revenue-maximizing Order of Sale in Sequential Auctions</i>.
    Universität Paderborn.
  bibtex: '@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential
    Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012}
    }'
  chicago: Drücker, Julian. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>.
    Universität Paderborn, 2012.
  ieee: J. Drücker, <i>Revenue-maximizing Order of Sale in Sequential Auctions</i>.
    Universität Paderborn, 2012.
  mla: Drücker, Julian. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>.
    Universität Paderborn, 2012.
  short: J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität
    Paderborn, 2012.
date_created: 2017-10-17T12:42:45Z
date_updated: 2022-01-06T07:02:43Z
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Revenue-maximizing Order of Sale in Sequential Auctions
type: mastersthesis
user_id: '15504'
year: '2012'
...
---
_id: '584'
author:
- first_name: Till
  full_name: Hohenberger, Till
  last_name: Hohenberger
citation:
  ama: Hohenberger T. <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn; 2012.
  apa: Hohenberger, T. (2012). <i>Queuing Latency at Cooperative Base Stations</i>.
    Universität Paderborn.
  bibtex: '@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations},
    publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }'
  chicago: Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>.
    Universität Paderborn, 2012.
  ieee: T. Hohenberger, <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn, 2012.
  mla: Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität
    Paderborn, 2012.
  short: T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität
    Paderborn, 2012.
date_created: 2017-10-17T12:42:46Z
date_updated: 2022-01-06T07:02:43Z
department:
- _id: '75'
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Queuing Latency at Cooperative Base Stations
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '592'
author:
- first_name: Aydin
  full_name: Celik, Aydin
  last_name: Celik
citation:
  ama: 'Celik A. <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität
    Paderborn; 2012.'
  apa: 'Celik, A. (2012). <i>Penny Auctions: Design und Strategisches Verhalten</i>.
    Universität Paderborn.'
  bibtex: '@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten},
    publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }'
  chicago: 'Celik, Aydin. <i>Penny Auctions: Design und Strategisches Verhalten</i>.
    Universität Paderborn, 2012.'
  ieee: 'A. Celik, <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität
    Paderborn, 2012.'
  mla: 'Celik, Aydin. <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität
    Paderborn, 2012.'
  short: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität
    Paderborn, 2012.'
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: 'Penny Auctions: Design und Strategisches Verhalten'
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '593'
author:
- first_name: Tobias
  full_name: Rojahn, Tobias
  last_name: Rojahn
citation:
  ama: Rojahn T. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn; 2012.
  apa: Rojahn, T. (2012). <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn.
  bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten
    Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias},
    year={2012} }'
  chicago: Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  ieee: T. Rojahn, <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  mla: Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>.
    Universität Paderborn, 2012.
  short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:47Z
department:
- _id: '75'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '594'
author:
- first_name: Timo
  full_name: Klerx, Timo
  last_name: Klerx
citation:
  ama: Klerx T. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
    Netzen</i>. Universität Paderborn; 2012.
  apa: Klerx, T. (2012). <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
    von Neuronalen Netzen</i>. Universität Paderborn.
  bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken
    mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx,
    Timo}, year={2012} }'
  chicago: Klerx, Timo. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe
    von Neuronalen Netzen</i>. Universität Paderborn, 2012.
  ieee: T. Klerx, <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
    Netzen</i>. Universität Paderborn, 2012.
  mla: Klerx, Timo. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von
    Neuronalen Netzen</i>. Universität Paderborn, 2012.
  short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen
    Netzen, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:47Z
date_updated: 2022-01-06T07:02:48Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen
type: mastersthesis
user_id: '477'
year: '2012'
...
---
_id: '597'
abstract:
- lang: eng
  text: 'We consider strategic games in which each player seeks a mixed strategy to
    minimize her cost evaluated by a concave valuation V (mapping probability distributions
    to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer
    players where mixed equilibria always exist [15, 16], a mixed equilibrium for
    such games, called a V -equilibrium, may fail to exist, even though pure equilibria
    (if any) transfer over. What is the impact of such valuations on the existence,
    structure and complexity of mixed equilibria? We address this fundamental question
    for a particular concave valuation: expectation plus variance, denoted as RA,
    which stands for risk-averse; so, variance enters as a measure of risk and it
    is used as an additive adjustment to expectation. We obtain the following results
    about RA-equilibria:- A collection of general structural properties of RA-equilibria
    connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation
    and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable
    equilibrium properties.- A second collection of (i) existence, (ii) equivalence
    and separation (with respect to E-equilibria), and (iii) characterization results
    for RA-equilibria in the new class of player-specific scheduling games. Using
    examples, we provide the first demonstration that going from E to RA may as well
    create new mixed (RA-)equilibria.- A purification technique to transform a player-specific
    scheduling game on identical links into a player-specific scheduling game so that
    all non-pure RA-equilibria are eliminated while new pure equilibria cannot be
    created; so, a particular game on two identical links yields one with no RA-equilibrium.
    As a by-product, the first-completeness result for the computation of RA-equilibria
    follows.'
author:
- first_name: Marios
  full_name: Mavronicolas, Marios
  last_name: Mavronicolas
- first_name: Burkhard
  full_name: Monien, Burkhard
  last_name: Monien
citation:
  ama: 'Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: <i>Proceedings
    of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS.
    ; 2012:239-250. doi:<a href="https://doi.org/10.1007/978-3-642-33996-7_21">10.1007/978-3-642-33996-7_21</a>'
  apa: Mavronicolas, M., &#38; Monien, B. (2012). Minimizing Expectation Plus Variance.
    In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory
    (SAGT)</i> (pp. 239–250). <a href="https://doi.org/10.1007/978-3-642-33996-7_21">https://doi.org/10.1007/978-3-642-33996-7_21</a>
  bibtex: '@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing
    Expectation Plus Variance}, DOI={<a href="https://doi.org/10.1007/978-3-642-33996-7_21">10.1007/978-3-642-33996-7_21</a>},
    booktitle={Proceedings of the 5th International Symposium on Algorithmic Game
    Theory (SAGT)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2012},
    pages={239–250}, collection={LNCS} }'
  chicago: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus
    Variance.” In <i>Proceedings of the 5th International Symposium on Algorithmic
    Game Theory (SAGT)</i>, 239–50. LNCS, 2012. <a href="https://doi.org/10.1007/978-3-642-33996-7_21">https://doi.org/10.1007/978-3-642-33996-7_21</a>.
  ieee: M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in
    <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>,
    2012, pp. 239–250.
  mla: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.”
    <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>,
    2012, pp. 239–50, doi:<a href="https://doi.org/10.1007/978-3-642-33996-7_21">10.1007/978-3-642-33996-7_21</a>.
  short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium
    on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
ddc:
- '040'
doi: 10.1007/978-3-642-33996-7_21
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:20:53Z
  date_updated: 2018-03-15T08:20:53Z
  file_id: '1254'
  file_name: 597-newtocs_01.pdf
  file_size: 345826
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:20:53Z
has_accepted_license: '1'
page: 239-250
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 5th International Symposium on Algorithmic Game Theory
  (SAGT)
series_title: LNCS
status: public
title: Minimizing Expectation Plus Variance
type: conference
user_id: '15504'
year: '2012'
...
---
_id: '598'
author:
- first_name: Fuad
  full_name: Mammadov, Fuad
  last_name: Mammadov
citation:
  ama: Mammadov F. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>.
    Universität Paderborn; 2012.
  apa: Mammadov, F. (2012). <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>.
    Universität Paderborn.
  bibtex: '@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen
    Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad},
    year={2012} }'
  chicago: Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>.
    Universität Paderborn, 2012.
  ieee: F. Mammadov, <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>.
    Universität Paderborn, 2012.
  mla: Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>.
    Universität Paderborn, 2012.
  short: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen,
    Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:48Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '599'
author:
- first_name: Xenia
  full_name: Löwen, Xenia
  last_name: Löwen
citation:
  ama: 'Löwen X. <i>Managerial Delegation and Capacity Choices: An Analysis of the
    Cournot-Nash Equilibrium</i>. Universität Paderborn; 2012.'
  apa: 'Löwen, X. (2012). <i>Managerial Delegation and Capacity Choices: An Analysis
    of the Cournot-Nash Equilibrium</i>. Universität Paderborn.'
  bibtex: '@book{Löwen_2012, title={Managerial Delegation and Capacity Choices: An
    Analysis of the Cournot-Nash Equilibrium}, publisher={Universität Paderborn},
    author={Löwen, Xenia}, year={2012} }'
  chicago: 'Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis
    of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.'
  ieee: 'X. Löwen, <i>Managerial Delegation and Capacity Choices: An Analysis of the
    Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.'
  mla: 'Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of
    the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.'
  short: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the
    Cournot-Nash Equilibrium, Universität Paderborn, 2012.'
date_created: 2017-10-17T12:42:48Z
date_updated: 2022-01-06T07:02:49Z
project:
- _id: '1'
  name: SFB 901
- _id: '7'
  name: SFB 901 - Subprojekt A3
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: 'Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash
  Equilibrium'
type: bachelorsthesis
user_id: '15504'
year: '2012'
...
---
_id: '600'
author:
- first_name: Björn
  full_name: Feldkord, Björn
  id: '22704'
  last_name: Feldkord
citation:
  ama: Feldkord B. <i>Lokale Swaps und überholte Informationen in Basic Network Creation
    Games</i>. Universität Paderborn; 2012.
  apa: Feldkord, B. (2012). <i>Lokale Swaps und überholte Informationen in Basic Network
    Creation Games</i>. Universität Paderborn.
  bibtex: '@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in
    Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord,
    Björn}, year={2012} }'
  chicago: Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network
    Creation Games</i>. Universität Paderborn, 2012.
  ieee: B. Feldkord, <i>Lokale Swaps und überholte Informationen in Basic Network
    Creation Games</i>. Universität Paderborn, 2012.
  mla: Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network
    Creation Games</i>. Universität Paderborn, 2012.
  short: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation
    Games, Universität Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:49Z
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
title: Lokale Swaps und überholte Informationen in Basic Network Creation Games
type: bachelorsthesis
user_id: '477'
year: '2012'
...
---
_id: '601'
abstract:
- lang: eng
  text: Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen
    Gel{\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\"u}ssen sich
    selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur
    seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren
    Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen.
    In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich
    auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden
    k{\"o}nnen. Daf{\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen
    vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden
    obere und untere Schranken f{\"u}r die ben{\"o}tigte Anzahl Runden und die Bewegungsdistanz
    gezeigt. In einigen F{\"a}llen wird außerdem die ben{\"o}tigte Bewegungsdistanz
    mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie
    auf der gleichen Instanz ben{\"o}tigen w{\"u}rde. So werden kompetititve Faktoren
    hergeleitet.
author:
- first_name: Barbara
  full_name: Kempkes, Barbara
  last_name: Kempkes
citation:
  ama: Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn; 2012.
  apa: Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol.
    302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
  bibtex: '@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn}, title={Local strategies for robot formation problems}, volume={302},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes,
    Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts,
    Paderborn} }'
  chicago: Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>.
    Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
  ieee: B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.
  mla: Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
  short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, Paderborn, 2012.
date_created: 2017-10-17T12:42:49Z
date_updated: 2022-01-06T07:02:50Z
ddc:
- '040'
department:
- _id: '63'
- _id: '26'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-15T08:16:44Z
  date_updated: 2018-03-15T08:16:44Z
  file_id: '1252'
  file_name: 601-Kempkes-PhD.pdf
  file_size: 3805310
  relation: main_file
  success: 1
file_date_updated: 2018-03-15T08:16:44Z
has_accepted_license: '1'
intvolume: '       302'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication_identifier:
  isbn:
  - 978-3-942647-21-2
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
supervisor:
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
title: Local strategies for robot formation problems
type: dissertation
user_id: '5786'
volume: 302
year: '2012'
...