---
_id: '16365'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Degener B, Kempkes B, Kling P, Meyer auf der Heide F. A Continuous, Local
Strategy for Constructing a Short Chain of Mobile Robots. In: Structural Information
and Communication Complexity. SIROCCO 2010. Berlin, Heidelberg; 2010:168-182.
doi:10.1007/978-3-642-13284-1_14'
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2010).
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.
In Structural Information and Communication Complexity (pp. 168–182). Berlin,
Heidelberg. https://doi.org/10.1007/978-3-642-13284-1_14
bibtex: '@inbook{Degener_Kempkes_Kling_Meyer auf der Heide_2010, place={Berlin,
Heidelberg}, series={SIROCCO 2010}, title={A Continuous, Local Strategy for Constructing
a Short Chain of Mobile Robots}, DOI={10.1007/978-3-642-13284-1_14},
booktitle={Structural Information and Communication Complexity}, author={Degener,
Bastian and Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm},
year={2010}, pages={168–182}, collection={SIROCCO 2010} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile
Robots.” In Structural Information and Communication Complexity, 168–82.
SIROCCO 2010. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-13284-1_14.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous,
Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.
mla: Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short
Chain of Mobile Robots.” Structural Information and Communication Complexity,
2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.
short: 'B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, in: Structural
Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.'
date_created: 2020-04-02T13:56:17Z
date_updated: 2022-01-06T06:52:49Z
department:
- _id: '63'
doi: 10.1007/978-3-642-13284-1_14
language:
- iso: eng
page: 168-182
place: Berlin, Heidelberg
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783642132834'
- '9783642132841'
issn:
- 0302-9743
- 1611-3349
publication_status: published
series_title: SIROCCO 2010
status: public
title: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16403'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14162-1
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14162-1
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II.}, DOI={10.1007/978-3-642-14162-1},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14162-1.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:56:30Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14162-1
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part II.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '16404'
citation:
ama: Abramsky S, Gavoille C, Kirchner C, Meyer auf der Heide F, Spirakis PG, eds.
Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-14165-2
apa: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., & Spirakis,
P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International
Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2
bibtex: '@book{Abramsky_Gavoille_Kirchner_Meyer auf der Heide_Spirakis_2010, place={Berlin,
Heidelberg}, title={Automata, Languages and Programming, 37th International Colloquium,
ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I.}, DOI={10.1007/978-3-642-14165-2},
year={2010} }'
chicago: Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf
der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-14165-2.
ieee: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis,
Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg,
2010.
mla: Abramsky, Samson, et al., editors. Automata, Languages and Programming,
37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010,
Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.
short: S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, P.G. Spirakis,
eds., Automata, Languages and Programming, 37th International Colloquium, ICALP
2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I., Berlin, Heidelberg,
2010.
date_created: 2020-04-03T12:58:05Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-14165-2
editor:
- first_name: Samson
full_name: Abramsky, Samson
last_name: Abramsky
- first_name: Cyril
full_name: Gavoille, Cyril
last_name: Gavoille
- first_name: Claude
full_name: Kirchner, Claude
last_name: Kirchner
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Paul G.
full_name: Spirakis, Paul G.
last_name: Spirakis
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642141614'
- '9783642141621'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010,
Bordeaux, France, July 6-10, 2010, Proceedings, Part I.
type: book_editor
user_id: '15415'
year: '2010'
...
---
_id: '13301'
author:
- first_name: Matthias
full_name: Trier, Matthias
id: '72744'
last_name: Trier
- first_name: Claudia
full_name: Müller, Claudia
last_name: Müller
citation:
ama: 'Trier M, Müller C. Towards a Systematic Approach for Capturing Knowledge-Intensive
Business Processes. In: Practical Aspects of Knowledge Management. Berlin,
Heidelberg; 2010. doi:10.1007/978-3-540-30545-3_23'
apa: Trier, M., & Müller, C. (2010). Towards a Systematic Approach for Capturing
Knowledge-Intensive Business Processes. In Practical Aspects of Knowledge Management.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30545-3_23
bibtex: '@inbook{Trier_Müller_2010, place={Berlin, Heidelberg}, title={Towards a
Systematic Approach for Capturing Knowledge-Intensive Business Processes}, DOI={10.1007/978-3-540-30545-3_23},
booktitle={Practical Aspects of Knowledge Management}, author={Trier, Matthias
and Müller, Claudia}, year={2010} }'
chicago: Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for
Capturing Knowledge-Intensive Business Processes.” In Practical Aspects of
Knowledge Management. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-540-30545-3_23.
ieee: M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive
Business Processes,” in Practical Aspects of Knowledge Management, Berlin,
Heidelberg, 2010.
mla: Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing
Knowledge-Intensive Business Processes.” Practical Aspects of Knowledge Management,
2010, doi:10.1007/978-3-540-30545-3_23.
short: 'M. Trier, C. Müller, in: Practical Aspects of Knowledge Management, Berlin,
Heidelberg, 2010.'
date_created: 2019-09-19T09:45:04Z
date_updated: 2022-01-06T06:51:32Z
department:
- _id: '198'
doi: 10.1007/978-3-540-30545-3_23
language:
- iso: eng
place: Berlin, Heidelberg
publication: Practical Aspects of Knowledge Management
publication_identifier:
isbn:
- '9783540240884'
- '9783540305453'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes
type: book_chapter
user_id: '62809'
year: '2010'
...
---
_id: '19724'
abstract:
- lang: eng
text: We introduce a geometric multi-robot assignment problem. Robots positioned
in a Euclidean space have to be assigned to treasures in such a way that their
joint strength is sufficient to unearth a treasure with a given weight. The robots
have a limited range and thus can only be assigned to treasures in their proximity.
The objective is to unearth as many treasures as possible. We investigate the
complexity of several variants of this problem and show whether they are in $\classP$
or are $\classNP$-complete. Furthermore, we provide a distributed and local constant-factor
approximation algorithm using constant-factor resource augmentation for the two-dimensional
setting with $\bigO(\log^*n)$ communication rounds.
author:
- first_name: Olaf
full_name: Bonorden, Olaf
last_name: Bonorden
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Pietrzyk, Peter
last_name: Pietrzyk
citation:
ama: 'Bonorden O, Degener B, Kempkes B, Pietrzyk P. Complexity and Approximation
of a Geometric Local Robot Assignment Problem. In: Algorithmic Aspects of Wireless
Sensor Networks. Berlin, Heidelberg: Springer; 2009:252-262. doi:10.1007/978-3-642-05434-1_25'
apa: 'Bonorden, O., Degener, B., Kempkes, B., & Pietrzyk, P. (2009). Complexity
and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic
Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer.
https://doi.org/10.1007/978-3-642-05434-1_25'
bibtex: '@inbook{Bonorden_Degener_Kempkes_Pietrzyk_2009, place={Berlin, Heidelberg},
title={Complexity and Approximation of a Geometric Local Robot Assignment Problem},
DOI={10.1007/978-3-642-05434-1_25},
booktitle={Algorithmic Aspects of Wireless Sensor Networks}, publisher={Springer},
author={Bonorden, Olaf and Degener, Bastian and Kempkes, Barbara and Pietrzyk,
Peter}, year={2009}, pages={252–262} }'
chicago: 'Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk.
“Complexity and Approximation of a Geometric Local Robot Assignment Problem.”
In Algorithmic Aspects of Wireless Sensor Networks, 252–62. Berlin, Heidelberg:
Springer, 2009. https://doi.org/10.1007/978-3-642-05434-1_25.'
ieee: 'O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation
of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless
Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.'
mla: Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot
Assignment Problem.” Algorithmic Aspects of Wireless Sensor Networks, Springer,
2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.
short: 'O. Bonorden, B. Degener, B. Kempkes, P. Pietrzyk, in: Algorithmic Aspects
of Wireless Sensor Networks, Springer, Berlin, Heidelberg, 2009, pp. 252–262.'
date_created: 2020-09-28T10:25:34Z
date_updated: 2022-01-06T06:54:10Z
department:
- _id: '63'
doi: 10.1007/978-3-642-05434-1_25
language:
- iso: eng
page: 252-262
place: Berlin, Heidelberg
publication: Algorithmic Aspects of Wireless Sensor Networks
publication_identifier:
isbn:
- '9783642054334'
- '9783642054341'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Complexity and Approximation of a Geometric Local Robot Assignment Problem
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '2920'
author:
- first_name: Saqib
full_name: Kakvi, Saqib
last_name: Kakvi
citation:
ama: 'Kakvi S. Reinforcement Learning for Blackjack. In: Lecture Notes in Computer
Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2009:300-301. doi:10.1007/978-3-642-04052-8_43'
apa: 'Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes
in Computer Science (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-642-04052-8_43'
bibtex: '@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning
for Blackjack}, DOI={10.1007/978-3-642-04052-8_43},
booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg},
author={Kakvi, Saqib}, year={2009}, pages={300–301} }'
chicago: 'Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In Lecture Notes
in Computer Science, 300–301. Berlin, Heidelberg: Springer Berlin Heidelberg,
2009. https://doi.org/10.1007/978-3-642-04052-8_43.'
ieee: 'S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in
Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp.
300–301.'
mla: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer
Science, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:10.1007/978-3-642-04052-8_43.
short: 'S. Kakvi, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2009, pp. 300–301.'
date_created: 2018-05-25T12:38:01Z
date_updated: 2022-01-06T06:58:47Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
page: 300-301
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783642040511'
- '9783642040528'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '3000'
author:
- first_name: Jonas
full_name: Schrieb, Jonas
last_name: Schrieb
- first_name: Heike
full_name: Wehrheim, Heike
id: '573'
last_name: Wehrheim
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Schrieb J, Wehrheim H, Wonisch D. Three-Valued Spotlight Abstractions. In:
FM 2009: Formal Methods. Berlin, Heidelberg: Springer Berlin Heidelberg;
2009:106-122. doi:10.1007/978-3-642-05089-3_8'
apa: 'Schrieb, J., Wehrheim, H., & Wonisch, D. (2009). Three-Valued Spotlight
Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg:
Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-05089-3_8'
bibtex: '@inbook{Schrieb_Wehrheim_Wonisch_2009, place={Berlin, Heidelberg}, title={Three-Valued
Spotlight Abstractions}, DOI={10.1007/978-3-642-05089-3_8},
booktitle={FM 2009: Formal Methods}, publisher={Springer Berlin Heidelberg}, author={Schrieb,
Jonas and Wehrheim, Heike and Wonisch, Daniel}, year={2009}, pages={106–122} }'
chicago: 'Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight
Abstractions.” In FM 2009: Formal Methods, 106–22. Berlin, Heidelberg:
Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-05089-3_8.'
ieee: 'J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,”
in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg,
2009, pp. 106–122.'
mla: 'Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.” FM 2009:
Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.'
short: 'J. Schrieb, H. Wehrheim, D. Wonisch, in: FM 2009: Formal Methods, Springer
Berlin Heidelberg, Berlin, Heidelberg, 2009, pp. 106–122.'
date_created: 2018-06-05T08:09:11Z
date_updated: 2022-01-06T06:58:50Z
department:
- _id: '64'
doi: 10.1007/978-3-642-05089-3_8
page: 106-122
place: Berlin, Heidelberg
publication: 'FM 2009: Formal Methods'
publication_identifier:
isbn:
- '9783642050886'
- '9783642050893'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Three-Valued Spotlight Abstractions
type: book_chapter
user_id: '25078'
year: '2009'
...
---
_id: '23744'
abstract:
- lang: eng
text: "In a Stackelberg pricing game a leader aims to set prices on a subset of
a given collection of items, such as to maximize her revenue from a follower purchasing
a feasible subset of the items. We focus on the case of computationally bounded
followers who cannot optimize exactly over the range of all feasible subsets,
but apply some publicly known algorithm to determine the set of items to purchase.
This corresponds to general multi-dimensional pricing assuming that consumers
cannot optimize over the full domain of their valuation functions but still aim
to act rationally to the best of their ability.\r\n\r\nWe consider two versions
of this novel type of Stackelberg pricing games. Assuming that items are weighted
objects and the follower seeks to purchase a min-cost selection of objects of
some minimum weight (the Min-Knapsack problem) and uses a simple greedy 2-approximate
algorithm, we show how an extension of the known single-price algorithm can be
used to derive a polynomial-time (2 + ε)-approximation algorithm for the leader’s
revenue maximization problem based on so-called near-uniform price assignments.
We also prove the problem to be strongly NP-hard.\r\n\r\nConsidering the case
that items are subsets of some ground set which the follower seeks to cover (the
Set-Cover problem) via a standard primal-dual approach, we prove that near-uniform
price assignments fail to yield a good approximation guarantee. However, in the
special case of elements with frequency 2 (the Vertex-Cover problem) it turns
out that exact revenue maximization can be done in polynomial-time. This stands
in sharp contrast to the fact that revenue maximization becomes APX-hard already
for elements with frequency 3."
author:
- first_name: Patrick
full_name: Briest, Patrick
last_name: Briest
- first_name: Martin
full_name: Hoefer, Martin
last_name: Hoefer
- first_name: Luciano
full_name: Gualà, Luciano
last_name: Gualà
- first_name: Carmine
full_name: Ventre, Carmine
last_name: Ventre
citation:
ama: 'Briest P, Hoefer M, Gualà L, Ventre C. On Stackelberg Pricing with Computationally
Bounded Consumers. In: Lecture Notes in Computer Science. Berlin, Heidelberg;
2009. doi:10.1007/978-3-642-10841-9_6'
apa: Briest, P., Hoefer, M., Gualà, L., & Ventre, C. (2009). On Stackelberg
Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer
Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_6
bibtex: '@inbook{Briest_Hoefer_Gualà_Ventre_2009, place={Berlin, Heidelberg}, title={On
Stackelberg Pricing with Computationally Bounded Consumers}, DOI={10.1007/978-3-642-10841-9_6},
booktitle={Lecture Notes in Computer Science}, author={Briest, Patrick and Hoefer,
Martin and Gualà, Luciano and Ventre, Carmine}, year={2009} }'
chicago: Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On
Stackelberg Pricing with Computationally Bounded Consumers.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-10841-9_6.
ieee: P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with
Computationally Bounded Consumers,” in Lecture Notes in Computer Science,
Berlin, Heidelberg, 2009.
mla: Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded
Consumers.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.
short: 'P. Briest, M. Hoefer, L. Gualà, C. Ventre, in: Lecture Notes in Computer
Science, Berlin, Heidelberg, 2009.'
date_created: 2021-09-03T10:55:38Z
date_updated: 2022-01-06T06:55:59Z
department:
- _id: '63'
doi: 10.1007/978-3-642-10841-9_6
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: On Stackelberg Pricing with Computationally Bounded Consumers
type: book_chapter
user_id: '15415'
year: '2009'
...
---
_id: '1830'
author:
- first_name: Thorsten
full_name: Biermann, Thorsten
last_name: Biermann
- first_name: Arne
full_name: Schwabe, Arne
last_name: Schwabe
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
citation:
ama: 'Biermann T, Schwabe A, Karl H. Creating Butterflies in the Core – A Network
Coding Extension for MPLS/RSVP-TE. In: NETWORKING 2009. Berlin, Heidelberg:
Springer Berlin Heidelberg; 2009:883-894. doi:10.1007/978-3-642-01399-7_69'
apa: 'Biermann, T., Schwabe, A., & Karl, H. (2009). Creating Butterflies in
the Core – A Network Coding Extension for MPLS/RSVP-TE. In NETWORKING 2009
(pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_69'
bibtex: '@inbook{Biermann_Schwabe_Karl_2009, place={Berlin, Heidelberg}, title={Creating
Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE}, DOI={10.1007/978-3-642-01399-7_69},
booktitle={NETWORKING 2009}, publisher={Springer Berlin Heidelberg}, author={Biermann,
Thorsten and Schwabe, Arne and Karl, Holger}, year={2009}, pages={883–894} }'
chicago: 'Biermann, Thorsten, Arne Schwabe, and Holger Karl. “Creating Butterflies
in the Core – A Network Coding Extension for MPLS/RSVP-TE.” In NETWORKING 2009,
883–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. https://doi.org/10.1007/978-3-642-01399-7_69.'
ieee: 'T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core –
A Network Coding Extension for MPLS/RSVP-TE,” in NETWORKING 2009, Berlin,
Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.'
mla: Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding
Extension for MPLS/RSVP-TE.” NETWORKING 2009, Springer Berlin Heidelberg,
2009, pp. 883–94, doi:10.1007/978-3-642-01399-7_69.
short: 'T. Biermann, A. Schwabe, H. Karl, in: NETWORKING 2009, Springer Berlin Heidelberg,
Berlin, Heidelberg, 2009, pp. 883–894.'
date_created: 2018-03-27T12:31:37Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '75'
doi: 10.1007/978-3-642-01399-7_69
page: 883-894
place: Berlin, Heidelberg
publication: NETWORKING 2009
publication_identifier:
isbn:
- '9783642013980'
- '9783642013997'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Berlin Heidelberg
status: public
title: Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE
type: book_chapter
user_id: '15572'
year: '2009'
...
---
_id: '9616'
author:
- first_name: Saqib
full_name: Kakvi, Saqib
id: '66268'
last_name: Kakvi
citation:
ama: 'Kakvi S. Reinforcement Learning for Blackjack. In: Lecture Notes in Computer
Science. Berlin, Heidelberg; 2009. doi:10.1007/978-3-642-04052-8_43'
apa: Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes
in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04052-8_43
bibtex: '@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning
for Blackjack}, DOI={10.1007/978-3-642-04052-8_43},
booktitle={Lecture Notes in Computer Science}, author={Kakvi, Saqib}, year={2009}
}'
chicago: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In Lecture Notes
in Computer Science. Berlin, Heidelberg, 2009. https://doi.org/10.1007/978-3-642-04052-8_43.
ieee: S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer
Science, Berlin, Heidelberg, 2009.
mla: Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer
Science, 2009, doi:10.1007/978-3-642-04052-8_43.
short: 'S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.'
date_created: 2019-05-06T09:54:39Z
date_updated: 2022-01-06T07:04:17Z
department:
- _id: '558'
doi: 10.1007/978-3-642-04052-8_43
extern: '1'
language:
- iso: eng
place: Berlin, Heidelberg
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783642040511'
- '9783642040528'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Reinforcement Learning for Blackjack
type: book_chapter
user_id: '66268'
year: '2009'
...