---
_id: '5926'
author:
- first_name: N
full_name: N, N
last_name: N
citation:
ama: N N. Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine
Analyse Mit Dem Adjusted-Winner-Verfahren. Universität Paderborn; 2015.
apa: N, N. (2015). Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien
- eine Analyse mit dem Adjusted-Winner-Verfahren. Universität Paderborn.
bibtex: '@book{N_2015, title={Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien
- eine Analyse mit dem Adjusted-Winner-Verfahren}, publisher={Universität Paderborn},
author={N, N}, year={2015} }'
chicago: N, N. Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien
- Eine Analyse Mit Dem Adjusted-Winner-Verfahren. Universität Paderborn, 2015.
ieee: N. N, Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien -
eine Analyse mit dem Adjusted-Winner-Verfahren. Universität Paderborn, 2015.
mla: N, N. Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine
Analyse Mit Dem Adjusted-Winner-Verfahren. Universität Paderborn, 2015.
short: N. N, Verhandlungserfolg Durch Reduktion von Verhandlungsasymmetrien - Eine
Analyse Mit Dem Adjusted-Winner-Verfahren, Universität Paderborn, 2015.
date_created: 2018-11-28T10:00:27Z
date_updated: 2022-11-30T14:28:44Z
department:
- _id: '205'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Verhandlungserfolg durch Reduktion von Verhandlungsasymmetrien - eine Analyse
mit dem Adjusted-Winner-Verfahren
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '2522'
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Jan-Philip
full_name: Gamp, Jan-Philip
last_name: Gamp
citation:
ama: Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market
games. Economic Theory. 2014;57(3):529-554. doi:10.1007/s00199-014-0846-7
apa: Brangewitz, S., & Gamp, J.-P. (2014). Competitive outcomes and the inner
core of NTU market games. Economic Theory, 57(3), 529–554. https://doi.org/10.1007/s00199-014-0846-7
bibtex: '@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner
core of NTU market games}, volume={57}, DOI={10.1007/s00199-014-0846-7},
number={3}, journal={Economic Theory}, publisher={Springer Nature}, author={Brangewitz,
Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }'
chicago: 'Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the
Inner Core of NTU Market Games.” Economic Theory 57, no. 3 (2014): 529–54.
https://doi.org/10.1007/s00199-014-0846-7.'
ieee: S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of
NTU market games,” Economic Theory, vol. 57, no. 3, pp. 529–554, 2014.
mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner
Core of NTU Market Games.” Economic Theory, vol. 57, no. 3, Springer Nature,
2014, pp. 529–54, doi:10.1007/s00199-014-0846-7.
short: S. Brangewitz, J.-P. Gamp, Economic Theory 57 (2014) 529–554.
date_created: 2018-04-26T10:52:28Z
date_updated: 2022-01-06T06:56:55Z
ddc:
- '040'
department:
- _id: '205'
- _id: '475'
doi: 10.1007/s00199-014-0846-7
file:
- access_level: closed
content_type: application/pdf
creator: cjhaake
date_created: 2018-08-09T09:35:19Z
date_updated: 2018-08-09T09:35:19Z
file_id: '3868'
file_name: Competitive outcomes and the inner core of NTU market games.pdf
file_size: 391317
relation: main_file
file_date_updated: 2018-08-09T09:35:19Z
has_accepted_license: '1'
intvolume: ' 57'
issue: '3'
language:
- iso: eng
page: 529-554
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '7'
name: SFB 901 - Subproject A3
publication: Economic Theory
publication_identifier:
issn:
- 0938-2259
- 1432-0479
publication_status: published
publisher: Springer Nature
status: public
title: Competitive outcomes and the inner core of NTU market games
type: journal_article
user_id: '65453'
volume: 57
year: '2014'
...
---
_id: '330'
author:
- first_name: Liesa
full_name: Drigalsky, Liesa
last_name: Drigalsky
citation:
ama: Drigalsky L. Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse.
Universität Paderborn; 2014.
apa: Drigalsky, L. (2014). Zur Ausbreitung und Behinderung von Epidemien - Eine
Netzwerkanalyse. Universität Paderborn.
bibtex: '@book{Drigalsky_2014, title={Zur Ausbreitung und Behinderung von Epidemien
- Eine Netzwerkanalyse}, publisher={Universität Paderborn}, author={Drigalsky,
Liesa}, year={2014} }'
chicago: Drigalsky, Liesa. Zur Ausbreitung und Behinderung von Epidemien - Eine
Netzwerkanalyse. Universität Paderborn, 2014.
ieee: L. Drigalsky, Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse.
Universität Paderborn, 2014.
mla: Drigalsky, Liesa. Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse.
Universität Paderborn, 2014.
short: L. Drigalsky, Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:56Z
date_updated: 2022-01-06T06:59:09Z
department:
- _id: '280'
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
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Zur Ausbreitung und Behinderung von Epidemien - Eine Netzwerkanalyse
type: bachelorsthesis
user_id: '42447'
year: '2014'
...
---
_id: '337'
author:
- first_name: Christopher
full_name: Berkemeier, Christopher
last_name: Berkemeier
citation:
ama: Berkemeier C. Verhandlungen vs Auktionen im Beschäftigungsmanagement.
Universität Paderborn; 2014.
apa: Berkemeier, C. (2014). Verhandlungen vs Auktionen im Beschäftigungsmanagement.
Universität Paderborn.
bibtex: '@book{Berkemeier_2014, title={Verhandlungen vs Auktionen im Beschäftigungsmanagement},
publisher={Universität Paderborn}, author={Berkemeier, Christopher}, year={2014}
}'
chicago: Berkemeier, Christopher. Verhandlungen vs Auktionen im Beschäftigungsmanagement.
Universität Paderborn, 2014.
ieee: C. Berkemeier, Verhandlungen vs Auktionen im Beschäftigungsmanagement.
Universität Paderborn, 2014.
mla: Berkemeier, Christopher. Verhandlungen vs Auktionen im Beschäftigungsmanagement.
Universität Paderborn, 2014.
short: C. Berkemeier, Verhandlungen vs Auktionen im Beschäftigungsmanagement, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:13Z
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: Verhandlungen vs Auktionen im Beschäftigungsmanagement
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '338'
author:
- first_name: Henri
full_name: Beck, Henri
last_name: Beck
citation:
ama: 'Beck H. Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet
Winner Verfahrens. Universität Paderborn; 2014.'
apa: 'Beck, H. (2014). Verhandlungen bei variablem status quo: Eine Modifikation
des Adjustet Winner Verfahrens. Universität Paderborn.'
bibtex: '@book{Beck_2014, title={Verhandlungen bei variablem status quo: Eine Modifikation
des Adjustet Winner Verfahrens}, publisher={Universität Paderborn}, author={Beck,
Henri}, year={2014} }'
chicago: 'Beck, Henri. Verhandlungen bei variablem status quo: Eine Modifikation
des Adjustet Winner Verfahrens. Universität Paderborn, 2014.'
ieee: 'H. Beck, Verhandlungen bei variablem status quo: Eine Modifikation des
Adjustet Winner Verfahrens. Universität Paderborn, 2014.'
mla: 'Beck, Henri. Verhandlungen bei variablem status quo: Eine Modifikation
des Adjustet Winner Verfahrens. Universität Paderborn, 2014.'
short: 'H. Beck, Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet
Winner Verfahrens, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:41:57Z
date_updated: 2022-01-06T06:59:13Z
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: 'Verhandlungen bei variablem status quo: Eine Modifikation des Adjustet Winner
Verfahrens'
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '341'
author:
- first_name: Terry
full_name: Fang Cheng, Terry
last_name: Fang Cheng
citation:
ama: Fang Cheng T. Two-Sided Market and Game Console Vendors. Universität
Paderborn; 2014.
apa: Fang Cheng, T. (2014). Two-Sided Market and Game Console Vendors. Universität
Paderborn.
bibtex: '@book{Fang Cheng_2014, title={Two-Sided Market and Game Console Vendors},
publisher={Universität Paderborn}, author={Fang Cheng, Terry}, year={2014} }'
chicago: Fang Cheng, Terry. Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
ieee: T. Fang Cheng, Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
mla: Fang Cheng, Terry. Two-Sided Market and Game Console Vendors. Universität
Paderborn, 2014.
short: T. Fang Cheng, Two-Sided Market and Game Console Vendors, Universität Paderborn,
2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:14Z
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: Two-Sided Market and Game Console Vendors
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '343'
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
citation:
ama: Künsemöller J. Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn; 2014.
apa: Künsemöller, J. (2014). Tragedy of the Common Cloud - Game Theory on the
Infrastructure-as-a-Service Market. Universität Paderborn.
bibtex: '@book{Künsemöller_2014, title={Tragedy of the Common Cloud - Game Theory
on the Infrastructure-as-a-Service Market}, publisher={Universität Paderborn},
author={Künsemöller, Jörn}, year={2014} }'
chicago: Künsemöller, Jörn. Tragedy of the Common Cloud - Game Theory on the
Infrastructure-as-a-Service Market. Universität Paderborn, 2014.
ieee: J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn, 2014.
mla: Künsemöller, Jörn. Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market. Universität Paderborn, 2014.
short: J. Künsemöller, Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market, Universität Paderborn, 2014.
date_created: 2017-10-17T12:41:58Z
date_updated: 2022-01-06T06:59:16Z
ddc:
- '040'
department:
- _id: '75'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:28:26Z
date_updated: 2018-03-20T07:28:26Z
file_id: '1421'
file_name: 343-2014_Diss_Kuensemoeller.pdf
file_size: 1378657
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:28:26Z
has_accepted_license: '1'
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
title: Tragedy of the Common Cloud - Game Theory on the Infrastructure-as-a-Service
Market
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '346'
abstract:
- lang: eng
text: One future goal of service-oriented computing is to realize global markets
of composed services. On such markets, service providers offer services that can
be flexibly combined with each other. However, most often, market participants
are not able to individually estimate the quality of traded services in advance.
As a consequence, even potentially profitable transactions between customers and
providers might not take place. In the worst case, this can induce a market failure.
To overcome this problem, we propose the incorporation of reputation information
as an indicator for expected service quality. We address On-The-Fly Computing
as a representative environment of markets of composed services. In this environment,
customers provide feedback on transactions. We present a conceptual design of
a reputation system which collects and processes user feedback, and provides it
to participants in the market. Our contribution includes the identification of
requirements for such a reputation system from a technical and an economic perspective.
Based on these requirements, we propose a flexible solution that facilitates the
incorporation of reputation information into markets of composed services while
simultaneously preserving privacy of customers who provide feedback. The requirements
we formulate in this paper have just been partially met in literature. An integrated
approach, however, has not been addressed yet.
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Alexander
full_name: Jungmann, Alexander
last_name: Jungmann
- first_name: Ronald
full_name: Petrlic, Ronald
last_name: Petrlic
- first_name: Marie Christin
full_name: Platenius, Marie Christin
last_name: Platenius
citation:
ama: 'Brangewitz S, Jungmann A, Petrlic R, Platenius MC. Towards a Flexible and
Privacy-Preserving Reputation System for Markets of Composed Services. In: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION).
; 2014:49-57.'
apa: Brangewitz, S., Jungmann, A., Petrlic, R., & Platenius, M. C. (2014). Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services.
In Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION) (pp. 49–57).
bibtex: '@inproceedings{Brangewitz_Jungmann_Petrlic_Platenius_2014, title={Towards
a Flexible and Privacy-Preserving Reputation System for Markets of Composed Services},
booktitle={Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)}, author={Brangewitz, Sonja and Jungmann, Alexander
and Petrlic, Ronald and Platenius, Marie Christin}, year={2014}, pages={49–57}
}'
chicago: Brangewitz, Sonja, Alexander Jungmann, Ronald Petrlic, and Marie Christin
Platenius. “Towards a Flexible and Privacy-Preserving Reputation System for Markets
of Composed Services.” In Proceedings of the 6th International Conferences
on Advanced Service Computing (SERVICE COMPUTATION), 49–57, 2014.
ieee: S. Brangewitz, A. Jungmann, R. Petrlic, and M. C. Platenius, “Towards a Flexible
and Privacy-Preserving Reputation System for Markets of Composed Services,” in
Proceedings of the 6th International Conferences on Advanced Service Computing
(SERVICE COMPUTATION), 2014, pp. 49–57.
mla: Brangewitz, Sonja, et al. “Towards a Flexible and Privacy-Preserving Reputation
System for Markets of Composed Services.” Proceedings of the 6th International
Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2014, pp.
49–57.
short: 'S. Brangewitz, A. Jungmann, R. Petrlic, M.C. Platenius, in: Proceedings
of the 6th International Conferences on Advanced Service Computing (SERVICE COMPUTATION),
2014, pp. 49–57.'
date_created: 2017-10-17T12:41:59Z
date_updated: 2022-01-06T06:59:18Z
ddc:
- '040'
department:
- _id: '205'
- _id: '76'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:26:49Z
date_updated: 2018-03-20T07:26:49Z
file_id: '1418'
file_name: 346-service_computation_2014_3_10_10005.pdf
file_size: 334101
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:26:49Z
has_accepted_license: '1'
language:
- iso: eng
page: 49-57
project:
- _id: '1'
name: SFB 901
- _id: '13'
name: SFB 901 - Subprojekt C1
- _id: '9'
name: SFB 901 - Subprojekt B1
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '10'
name: SFB 901 - Subproject B2
- _id: '2'
name: SFB 901 - Project Area A
- _id: '3'
name: SFB 901 - Project Area B
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 6th International Conferences on Advanced Service
Computing (SERVICE COMPUTATION)
status: public
title: Towards a Flexible and Privacy-Preserving Reputation System for Markets of
Composed Services
type: conference
user_id: '477'
year: '2014'
...
---
_id: '350'
abstract:
- lang: eng
text: Customers continuously evaluate the credibility and reliability of a range
of signals both separately and jointly. However, existing econometric studies
pay insufficient attention to the interactions and complex combinations of these
signals, and are typically limited as a result of difficulties controlling for
multicollinearity and endogeneity in their data. We develop a novel theoretical
approach to address these issues and study different signaling effects (i.e.,
word-of-mouth, brand reputation, and distribution strategy) on customer perceptions.
Using data on the US video games market, we apply a fuzzy set qualitative comparative
analysis (fsQCA) to account for cause-effect relationships. The results of our
study address a number of key issues in the economics and management literature.
First, our results support the contention that reviews from professional critics
act as a signal of product quality and therefore positively influence unit sales,
as do the discriminatory effects of prices and restricted age ratings. Second,
we find evidence to support the use of brand extension strategies as marketing
tools that create spillover effects and support the launch of new products.
author:
- first_name: Daniel
full_name: Kaimann, Daniel
id: '18949'
last_name: Kaimann
- first_name: Joe
full_name: Cox, Joe
last_name: Cox
citation:
ama: 'Kaimann D, Cox J. The Interaction of Signals: A Fuzzy Set Analysis of the
Video Game Industry. Universität Paderborn; 2014.'
apa: 'Kaimann, D., & Cox, J. (2014). The Interaction of Signals: A Fuzzy
set Analysis of the Video Game Industry. Universität Paderborn.'
bibtex: '@book{Kaimann_Cox_2014, title={The Interaction of Signals: A Fuzzy set
Analysis of the Video Game Industry}, publisher={Universität Paderborn}, author={Kaimann,
Daniel and Cox, Joe}, year={2014} }'
chicago: 'Kaimann, Daniel, and Joe Cox. The Interaction of Signals: A Fuzzy Set
Analysis of the Video Game Industry. Universität Paderborn, 2014.'
ieee: 'D. Kaimann and J. Cox, The Interaction of Signals: A Fuzzy set Analysis
of the Video Game Industry. Universität Paderborn, 2014.'
mla: 'Kaimann, Daniel, and Joe Cox. The Interaction of Signals: A Fuzzy Set Analysis
of the Video Game Industry. Universität Paderborn, 2014.'
short: 'D. Kaimann, J. Cox, The Interaction of Signals: A Fuzzy Set Analysis of
the Video Game Industry, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:20Z
ddc:
- '040'
department:
- _id: '183'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:24:40Z
date_updated: 2018-03-20T07:24:40Z
file_id: '1416'
file_name: 350-SSRN-id2456991.pdf
file_size: 739169
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:24:40Z
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: 'The Interaction of Signals: A Fuzzy set Analysis of the Video Game Industry'
type: report
user_id: '477'
year: '2014'
...
---
_id: '351'
author:
- first_name: Lena
full_name: Holzweißig, Lena
last_name: Holzweißig
citation:
ama: Holzweißig L. The Impact of Customer Reviews and Reputation on Hotel Prices.
Universität Paderborn; 2014.
apa: Holzweißig, L. (2014). The Impact of Customer Reviews and Reputation on
Hotel Prices. Universität Paderborn.
bibtex: '@book{Holzweißig_2014, title={The Impact of Customer Reviews and Reputation
on Hotel Prices}, publisher={Universität Paderborn}, author={Holzweißig, Lena},
year={2014} }'
chicago: Holzweißig, Lena. The Impact of Customer Reviews and Reputation on Hotel
Prices. Universität Paderborn, 2014.
ieee: L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices.
Universität Paderborn, 2014.
mla: Holzweißig, Lena. The Impact of Customer Reviews and Reputation on Hotel
Prices. Universität Paderborn, 2014.
short: L. Holzweißig, The Impact of Customer Reviews and Reputation on Hotel Prices,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:20Z
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: The Impact of Customer Reviews and Reputation on Hotel Prices
type: mastersthesis
user_id: '477'
year: '2014'
...
---
_id: '352'
author:
- first_name: Friedrich
full_name: Scheel, Friedrich
last_name: Scheel
citation:
ama: 'Scheel F. The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments. Universität Paderborn; 2014.'
apa: 'Scheel, F. (2014). The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn.'
bibtex: '@book{Scheel_2014, title={The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments}, publisher={Universität
Paderborn}, author={Scheel, Friedrich}, year={2014} }'
chicago: 'Scheel, Friedrich. The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn,
2014.'
ieee: 'F. Scheel, The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments. Universität Paderborn, 2014.'
mla: 'Scheel, Friedrich. The Economics of Individual Behavior in Competitive
Environments: Empirical Evidence from Real-Life Tournaments. Universität Paderborn,
2014.'
short: 'F. Scheel, The Economics of Individual Behavior in Competitive Environments:
Empirical Evidence from Real-Life Tournaments, Universität Paderborn, 2014.'
date_created: 2017-10-17T12:42:00Z
date_updated: 2022-01-06T06:59:21Z
ddc:
- '040'
department:
- _id: '19'
- _id: '183'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:24:10Z
date_updated: 2018-03-20T07:24:10Z
file_id: '1415'
file_name: 352-Diss_Veröffentlichung_Friedrich_Scheel.pdf
file_size: 1609436
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:24:10Z
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
supervisor:
- first_name: Bernd
full_name: Frick, Bernd
last_name: Frick
title: 'The Economics of Individual Behavior in Competitive Environments: Empirical
Evidence from Real-Life Tournaments'
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '357'
author:
- first_name: Olga
full_name: Ebel, Olga
last_name: Ebel
citation:
ama: Ebel O. Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten. Universität Paderborn; 2014.
apa: Ebel, O. (2014). Struktur und algorithmische Bestimmung stabiler Matchings
in one-to-one Matching Märkten. Universität Paderborn.
bibtex: '@book{Ebel_2014, title={Struktur und algorithmische Bestimmung stabiler
Matchings in one-to-one Matching Märkten}, publisher={Universität Paderborn},
author={Ebel, Olga}, year={2014} }'
chicago: Ebel, Olga. Struktur und algorithmische Bestimmung stabiler Matchings
in one-to-one Matching Märkten. Universität Paderborn, 2014.
ieee: O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten. Universität Paderborn, 2014.
mla: Ebel, Olga. Struktur und algorithmische Bestimmung stabiler Matchings in
one-to-one Matching Märkten. Universität Paderborn, 2014.
short: O. Ebel, Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one
Matching Märkten, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
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: Struktur und algorithmische Bestimmung stabiler Matchings in one-to-one Matching
Märkten
type: bachelorsthesis
user_id: '477'
year: '2014'
...
---
_id: '358'
author:
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
citation:
ama: Röhl N. Strategic and Cooperative Games in Network Economics. Universität
Paderborn; 2014.
apa: Röhl, N. (2014). Strategic and Cooperative Games in Network Economics.
Universität Paderborn.
bibtex: '@book{Röhl_2014, title={Strategic and Cooperative Games in Network Economics},
publisher={Universität Paderborn}, author={Röhl, Nils}, year={2014} }'
chicago: Röhl, Nils. Strategic and Cooperative Games in Network Economics.
Universität Paderborn, 2014.
ieee: N. Röhl, Strategic and Cooperative Games in Network Economics. Universität
Paderborn, 2014.
mla: Röhl, Nils. Strategic and Cooperative Games in Network Economics. Universität
Paderborn, 2014.
short: N. Röhl, Strategic and Cooperative Games in Network Economics, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:01Z
date_updated: 2022-01-06T06:59:25Z
ddc:
- '040'
department:
- _id: '19'
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:21:29Z
date_updated: 2018-03-20T07:21:29Z
file_id: '1410'
file_name: 358-DissertationRoehl.pdf
file_size: 1230059
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:21:29Z
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
supervisor:
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
title: Strategic and Cooperative Games in Network Economics
type: dissertation
user_id: '477'
year: '2014'
...
---
_id: '362'
author:
- first_name: Sarah
full_name: Kaiser, Sarah
last_name: Kaiser
citation:
ama: Kaiser S. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn; 2014.
apa: Kaiser, S. (2014). Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn.
bibtex: '@book{Kaiser_2014, title={Signalisieren und Screening in Arbeitsmärkten
- die Experimente von Brandts & Holt und Kübler et. al}, publisher={Universität
Paderborn}, author={Kaiser, Sarah}, year={2014} }'
chicago: Kaiser, Sarah. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
ieee: S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
mla: Kaiser, Sarah. Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al. Universität Paderborn, 2014.
short: S. Kaiser, Signalisieren und Screening in Arbeitsmärkten - die Experimente
von Brandts & Holt und Kübler et. al, Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:02Z
date_updated: 2022-01-06T06:59:27Z
department:
- _id: '280'
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
supervisor:
- first_name: Burkhard
full_name: Hehenkamp, Burkhard
id: '37339'
last_name: Hehenkamp
title: Signalisieren und Screening in Arbeitsmärkten - die Experimente von Brandts
& Holt und Kübler et. al
type: bachelorsthesis
user_id: '42447'
year: '2014'
...
---
_id: '370'
abstract:
- lang: eng
text: 'Max-min fairness (MMF) is a widely known approach to a fair allocation of
bandwidth to each of the users in a network. This allocation can be computed by
uniformly raising the bandwidths of all users without violating capacity constraints.
We consider an extension of these allocations by raising the bandwidth with arbitrary
and not necessarily uniform time-depending velocities (allocation rates). These
allocations are used in a game-theoretic context for routing choices, which we
formalize in progressive filling games (PFGs).We present a variety of results
for equilibria in PFGs. We show that these games possess pure Nash and strong
equilibria. While computation in general is NP-hard, there are polynomial-time
algorithms for prominent classes of Max-Min-Fair Games (MMFG), including the case
when all users have the same source-destination pair. We characterize prices of
anarchy and stability for pure Nash and strong equilibria in PFGs and MMFGs when
players have different or the same source-destination pairs. In addition, we show
that when a designer can adjust allocation rates, it is possible to design games
with optimal strong equilibria. Some initial results on polynomial-time algorithms
in this direction are also derived. '
author:
- first_name: Tobias
full_name: Harks, Tobias
last_name: Harks
- first_name: Martin
full_name: Höfer, Martin
last_name: Höfer
- first_name: Kevin
full_name: Schewior, Kevin
last_name: Schewior
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Harks T, Höfer M, Schewior K, Skopalik A. Routing Games with Progressive Filling.
In: Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14). ; 2014:352-360. doi:10.1109/TNET.2015.2468571'
apa: Harks, T., Höfer, M., Schewior, K., & Skopalik, A. (2014). Routing Games
with Progressive Filling. In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14) (pp. 352–360). https://doi.org/10.1109/TNET.2015.2468571
bibtex: '@inproceedings{Harks_Höfer_Schewior_Skopalik_2014, title={Routing Games
with Progressive Filling}, DOI={10.1109/TNET.2015.2468571},
booktitle={Proceedings of the 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM’14)}, author={Harks, Tobias and Höfer, Martin and Schewior,
Kevin and Skopalik, Alexander}, year={2014}, pages={352–360} }'
chicago: Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing
Games with Progressive Filling.” In Proceedings of the 33rd Annual IEEE International
Conference on Computer Communications (INFOCOM’14), 352–60, 2014. https://doi.org/10.1109/TNET.2015.2468571.
ieee: T. Harks, M. Höfer, K. Schewior, and A. Skopalik, “Routing Games with Progressive
Filling,” in Proceedings of the 33rd Annual IEEE International Conference on
Computer Communications (INFOCOM’14), 2014, pp. 352–360.
mla: Harks, Tobias, et al. “Routing Games with Progressive Filling.” Proceedings
of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–60, doi:10.1109/TNET.2015.2468571.
short: 'T. Harks, M. Höfer, K. Schewior, A. Skopalik, in: Proceedings of the 33rd
Annual IEEE International Conference on Computer Communications (INFOCOM’14),
2014, pp. 352–360.'
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1109/TNET.2015.2468571
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:04Z
date_updated: 2018-03-20T07:17:04Z
file_id: '1402'
file_name: 370-HHSS14.pdf
file_size: 179583
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 352-360
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 33rd Annual IEEE International Conference on Computer
Communications (INFOCOM'14)
status: public
title: Routing Games with Progressive Filling
type: conference
user_id: '477'
year: '2014'
...
---
_id: '373'
author:
- first_name: David
full_name: Pahl, David
last_name: Pahl
citation:
ama: Pahl D. Reputationssysteme für zusammengesetzte Dienstleistungen. Universität
Paderborn; 2014.
apa: Pahl, D. (2014). Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn.
bibtex: '@book{Pahl_2014, title={Reputationssysteme für zusammengesetzte Dienstleistungen},
publisher={Universität Paderborn}, author={Pahl, David}, year={2014} }'
chicago: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
ieee: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
mla: Pahl, David. Reputationssysteme für zusammengesetzte Dienstleistungen.
Universität Paderborn, 2014.
short: D. Pahl, Reputationssysteme für zusammengesetzte Dienstleistungen, Universität
Paderborn, 2014.
date_created: 2017-10-17T12:42:04Z
date_updated: 2022-01-06T06:59:31Z
department:
- _id: '63'
- _id: '541'
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
supervisor:
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
title: Reputationssysteme für zusammengesetzte Dienstleistungen
type: bachelorsthesis
user_id: '14052'
year: '2014'
...
---
_id: '382'
abstract:
- lang: eng
text: This paper explores how cloud provider competition influences instance pricing
in an IaaS (Infrastructure-as-a-Service) market. When reserved instance pricing
includes an on-demand price component in addition to a reservation fee (two-part
tariffs), different providers might offer different price combinations, where
the client’s choice depends on its load profile. We investigate a duopoly of providers
and analyze stable market prices in two-part tariffs. Further, we study offers
that allow a specified amount of included usage (three-part tariffs). Neither two-part
nor three-part tariffs produce an equilibrium market outcome other than a service
pricing that equals production cost, i.e., complex price structures do not significantly
affect the results from ordinary Bertrand competition.
author:
- first_name: Jörn
full_name: Künsemöller, Jörn
last_name: Künsemöller
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Claus-Jochen
full_name: Haake, Claus-Jochen
id: '20801'
last_name: Haake
citation:
ama: 'Künsemöller J, Brangewitz S, Karl H, Haake C-J. Provider Competition in Infrastructure-as-a-Service.
In: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC). ; 2014:203-210. doi:10.1109/SCC.2014.35'
apa: Künsemöller, J., Brangewitz, S., Karl, H., & Haake, C.-J. (2014). Provider
Competition in Infrastructure-as-a-Service. In Proceedings of the 2014 IEEE
International Conference on Services Computing (SCC) (pp. 203–210). https://doi.org/10.1109/SCC.2014.35
bibtex: '@inproceedings{Künsemöller_Brangewitz_Karl_Haake_2014, title={Provider
Competition in Infrastructure-as-a-Service}, DOI={10.1109/SCC.2014.35},
booktitle={Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)}, author={Künsemöller, Jörn and Brangewitz, Sonja and Karl, Holger and Haake,
Claus-Jochen}, year={2014}, pages={203–210} }'
chicago: Künsemöller, Jörn, Sonja Brangewitz, Holger Karl, and Claus-Jochen Haake.
“Provider Competition in Infrastructure-as-a-Service.” In Proceedings of the
2014 IEEE International Conference on Services Computing (SCC), 203–10, 2014.
https://doi.org/10.1109/SCC.2014.35.
ieee: J. Künsemöller, S. Brangewitz, H. Karl, and C.-J. Haake, “Provider Competition
in Infrastructure-as-a-Service,” in Proceedings of the 2014 IEEE International
Conference on Services Computing (SCC), 2014, pp. 203–210.
mla: Künsemöller, Jörn, et al. “Provider Competition in Infrastructure-as-a-Service.”
Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC), 2014, pp. 203–10, doi:10.1109/SCC.2014.35.
short: 'J. Künsemöller, S. Brangewitz, H. Karl, C.-J. Haake, in: Proceedings of
the 2014 IEEE International Conference on Services Computing (SCC), 2014, pp.
203–210.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:37Z
ddc:
- '004'
department:
- _id: '75'
- _id: '205'
doi: 10.1109/SCC.2014.35
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T13:34:46Z
date_updated: 2018-11-02T13:34:46Z
file_id: '5250'
file_name: 06930535.pdf
file_size: 228172
relation: main_file
success: 1
file_date_updated: 2018-11-02T13:34:46Z
has_accepted_license: '1'
language:
- iso: eng
page: 203-210
project:
- _id: '1'
name: SFB 901
- _id: '6'
name: SFB 901 - Subprojekt A2
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 2014 IEEE International Conference on Services Computing
(SCC)
status: public
title: Provider Competition in Infrastructure-as-a-Service
type: conference
user_id: '477'
year: '2014'
...
---
_id: '443'
abstract:
- lang: eng
text: The objective of this paper is to analyze the formation of group structures
where individuals are allowed to engage in several groups at the same time. These
structures are interpreted here as social networks. Each of the groups is supposed
to have specific rules or constitutions governing which members may join or leave
it. A social network is then considered to be stable if none of the groups is
altered any more. Given this framework, we not only analyze which influence the
constitutions have on network formation but we also provide requirements under
which stable networks are induced for sure. Furthermore, by embedding many-to-many
matchings into our setting, we apply our model to job markets with labor unions.
To some extent the unions may provide job guarantees and, therefore, have influence
on the stability of the job market.
author:
- first_name: Ana
full_name: Mauleon, Ana
last_name: Mauleon
- first_name: Nils
full_name: Röhl, Nils
last_name: Röhl
- first_name: Vincent
full_name: Vannetelbosch, Vincent
last_name: Vannetelbosch
citation:
ama: Mauleon A, Röhl N, Vannetelbosch V. Constitutions and Social Networks.
Universität Paderborn; 2014.
apa: Mauleon, A., Röhl, N., & Vannetelbosch, V. (2014). Constitutions and
Social Networks. Universität Paderborn.
bibtex: '@book{Mauleon_Röhl_Vannetelbosch_2014, title={Constitutions and Social
Networks}, publisher={Universität Paderborn}, author={Mauleon, Ana and Röhl, Nils
and Vannetelbosch, Vincent}, year={2014} }'
chicago: Mauleon, Ana, Nils Röhl, and Vincent Vannetelbosch. Constitutions and
Social Networks. Universität Paderborn, 2014.
ieee: A. Mauleon, N. Röhl, and V. Vannetelbosch, Constitutions and Social Networks.
Universität Paderborn, 2014.
mla: Mauleon, Ana, et al. Constitutions and Social Networks. Universität
Paderborn, 2014.
short: A. Mauleon, N. Röhl, V. Vannetelbosch, Constitutions and Social Networks,
Universität Paderborn, 2014.
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:03Z
ddc:
- '040'
department:
- _id: '205'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:28:04Z
date_updated: 2018-03-16T11:28:04Z
file_id: '1350'
file_name: 443-WP74.pdf
file_size: 409720
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:28:04Z
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: Constitutions and Social Networks
type: report
user_id: '477'
year: '2014'
...
---
_id: '445'
abstract:
- lang: eng
text: We consider the inner core as a solution concept for cooperative games with
non-transferable utility (NTU) and its relationship to payoffs of competitive
equilibria of markets that are induced by NTU games. An NTU game is an NTU market
game if there exists a market such that the set of utility allocations a coalition
can achieve in the market coincides with the set of utility allocations the coalition
can achieve in the game. In this paper, we introduce a new construction of a market
based on a closed subset of the inner core which satisfies a strict positive separability.
We show that the constructed market represents the NTU game and, further, has
the given closed set as the set of payoff vectors of competitive equilibria. It
turns out that this market is not uniquely determined, and thus, we obtain a class
of markets. Our results generalize those relating to competitive outcomes of NTU
market games in the literature.
author:
- first_name: Sonja
full_name: Brangewitz, Sonja
last_name: Brangewitz
- first_name: Jan-Philip
full_name: Gamp, Jan-Philip
last_name: Gamp
citation:
ama: Brangewitz S, Gamp J-P. Competitive outcomes and the inner core of NTU market
games. Economic Theory. 2014;(3):529-554. doi:10.1007/s00199-014-0846-7
apa: Brangewitz, S., & Gamp, J.-P. (2014). Competitive outcomes and the inner
core of NTU market games. Economic Theory, (3), 529–554. https://doi.org/10.1007/s00199-014-0846-7
bibtex: '@article{Brangewitz_Gamp_2014, title={Competitive outcomes and the inner
core of NTU market games}, DOI={10.1007/s00199-014-0846-7},
number={3}, journal={Economic Theory}, publisher={Springer}, author={Brangewitz,
Sonja and Gamp, Jan-Philip}, year={2014}, pages={529–554} }'
chicago: 'Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the
Inner Core of NTU Market Games.” Economic Theory, no. 3 (2014): 529–54.
https://doi.org/10.1007/s00199-014-0846-7.'
ieee: S. Brangewitz and J.-P. Gamp, “Competitive outcomes and the inner core of
NTU market games,” Economic Theory, no. 3, pp. 529–554, 2014.
mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Competitive Outcomes and the Inner
Core of NTU Market Games.” Economic Theory, no. 3, Springer, 2014, pp.
529–54, doi:10.1007/s00199-014-0846-7.
short: S. Brangewitz, J.-P. Gamp, Economic Theory (2014) 529–554.
date_created: 2017-10-17T12:42:18Z
date_updated: 2022-01-06T07:01:04Z
ddc:
- '040'
department:
- _id: '205'
doi: 10.1007/s00199-014-0846-7
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:27:32Z
date_updated: 2018-03-16T11:27:32Z
file_id: '1349'
file_name: 445-Brangewitz_and_Gamp__2014__-_Competitive_outcomes_and_the_inner_core_of_NTU_market_games.pdf
file_size: 391317
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:27:32Z
has_accepted_license: '1'
issue: '3'
language:
- iso: eng
page: 529-554
project:
- _id: '1'
name: SFB 901
- _id: '7'
name: SFB 901 - Subprojekt A3
- _id: '2'
name: SFB 901 - Project Area A
publication: Economic Theory
publisher: Springer
status: public
title: Competitive outcomes and the inner core of NTU market games
type: journal_article
user_id: '477'
year: '2014'
...
---
_id: '451'
abstract:
- lang: eng
text: We introduce the concept of budget games. Players choose a set of tasks and
each task has a certain demand on every resource in the game. Each resource has
a budget. If the budget is not enough to satisfy the sum of all demands, it has
to be shared between the tasks. We study strategic budget games, where the budget
is shared proportionally. We also consider a variant in which the order of the
strategic decisions influences the distribution of the budgets. The complexity
of the optimal solution as well as existence, complexity and quality of equilibria
are analysed. Finally, we show that the time an ordered budget game needs to convergence
towards an equilibrium may be exponential.
author:
- first_name: Maximilian
full_name: Drees, Maximilian
last_name: Drees
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: Alexander
full_name: Skopalik, Alexander
id: '40384'
last_name: Skopalik
citation:
ama: 'Drees M, Riechers S, Skopalik A. Budget-restricted utility games with ordered
strategic decisions. In: Lavi R, ed. Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT). Lecture Notes in Computer Science. ; 2014:110-121.
doi:10.1007/978-3-662-44803-8_10'
apa: Drees, M., Riechers, S., & Skopalik, A. (2014). Budget-restricted utility
games with ordered strategic decisions. In R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT) (pp. 110–121).
https://doi.org/10.1007/978-3-662-44803-8_10
bibtex: '@inproceedings{Drees_Riechers_Skopalik_2014, series={Lecture Notes in Computer
Science}, title={Budget-restricted utility games with ordered strategic decisions},
DOI={10.1007/978-3-662-44803-8_10},
booktitle={Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT)}, author={Drees, Maximilian and Riechers, Sören and Skopalik, Alexander},
editor={Lavi, RonEditor}, year={2014}, pages={110–121}, collection={Lecture Notes
in Computer Science} }'
chicago: Drees, Maximilian, Sören Riechers, and Alexander Skopalik. “Budget-Restricted
Utility Games with Ordered Strategic Decisions.” In Proceedings of the 7th
International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi,
110–21. Lecture Notes in Computer Science, 2014. https://doi.org/10.1007/978-3-662-44803-8_10.
ieee: M. Drees, S. Riechers, and A. Skopalik, “Budget-restricted utility games with
ordered strategic decisions,” in Proceedings of the 7th International Symposium
on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.
mla: Drees, Maximilian, et al. “Budget-Restricted Utility Games with Ordered Strategic
Decisions.” Proceedings of the 7th International Symposium on Algorithmic Game
Theory (SAGT), edited by Ron Lavi, 2014, pp. 110–21, doi:10.1007/978-3-662-44803-8_10.
short: 'M. Drees, S. Riechers, A. Skopalik, in: R. Lavi (Ed.), Proceedings of the
7th International Symposium on Algorithmic Game Theory (SAGT), 2014, pp. 110–121.'
date_created: 2017-10-17T12:42:20Z
date_updated: 2022-01-06T07:01:07Z
ddc:
- '040'
department:
- _id: '63'
- _id: '541'
doi: 10.1007/978-3-662-44803-8_10
editor:
- first_name: Ron
full_name: Lavi, Ron
last_name: Lavi
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:25:10Z
date_updated: 2018-03-16T11:25:10Z
file_id: '1344'
file_name: 451-DRS14.pdf
file_size: 283266
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:25:10Z
has_accepted_license: '1'
language:
- iso: eng
page: 110-121
project:
- _id: '1'
name: SFB 901
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '16'
name: SFB 901 - Subproject C4
- _id: '7'
name: SFB 901 - Subproject A3
- _id: '2'
name: SFB 901 - Project Area A
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 7th International Symposium on Algorithmic Game Theory
(SAGT)
series_title: Lecture Notes in Computer Science
status: public
title: Budget-restricted utility games with ordered strategic decisions
type: conference
user_id: '477'
year: '2014'
...