Zobrazeno 1 - 10
of 180
pro vyhledávání: '"Burkhard Monien"'
Publikováno v:
Theory of Computing Systems. 66:957-995
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::030f317618aabd169877a2237f32a077
https://doi.org/10.1007/s00224-022-10095-8
https://doi.org/10.1007/s00224-022-10095-8
Publikováno v:
Theoretical Computer Science. 860:84-97
We consider 2-players minimization games with very few cost values. Players are risk-averse and play mixed strategies. The players care about minimizing some function other than expectation or minimizing expectation with additional properties: Expect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::30e892b0bfc7f2c4bbdf3681960ba5e2
https://doi.org/10.1016/j.tcs.2021.01.031
https://doi.org/10.1016/j.tcs.2021.01.031
Autor:
Burkhard Monien, Dietrich Hartmann
Publikováno v:
50 Jahre akademisches Gespräch ISBN: 9783506760890
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46a825f8e5a537626df8b9482d3e745f
https://doi.org/10.30965/9783657760893_010
https://doi.org/10.30965/9783657760893_010
Autor:
Gerd Wechsung, Burkhard Monien
Publikováno v:
Journal of Graph Theory. 87:561-580
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ce749a1ab0454e14949d01c8b66f656
https://doi.org/10.1002/jgt.22175
https://doi.org/10.1002/jgt.22175
Autor:
Marios Mavronicolas, Burkhard Monien
Publikováno v:
Algorithmic Game Theory ISBN: 9783319666990
SAGT
SAGT
Conditional Value-at-Risk, denoted as \({\mathsf {CVaR}}_{\alpha }\), is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain; \(\alpha \in (0,1)\) is the confidence level. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e745117a86dec6026fbb9a8fde900973
https://doi.org/10.1007/978-3-319-66700-3_11
https://doi.org/10.1007/978-3-319-66700-3_11
Autor:
Dominic Dumrauf, Burkhard Monien
Publikováno v:
Theoretical Computer Science. 469:24-52
In this paper, we investigate the complexity of computing locally optimal solutions for the local search problem Maximum Constraint Assignment (MCA). For our investigation, we use the framework of PLS, as defined by Johnson et al. (1988) [9]. In a nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c97ef0611c36a6b821b34eb0127d631d
https://doi.org/10.1016/j.tcs.2012.10.044
https://doi.org/10.1016/j.tcs.2012.10.044
Publikováno v:
ACM Transactions on Algorithms. 7:1-31
In this work we study weighted network congestion games with player-specific latency functions where selfish players wish to route their traffic through a shared network. We consider both the case of splittable and unsplittable traffic. Our main find
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5f82b2d045d7d84c7c72138d42b985dd
https://doi.org/10.1145/1978782.1978786
https://doi.org/10.1145/1978782.1978786
Publikováno v:
SIAM Journal on Computing. 40:1211-1233
We show exact values for the worst-case price of anarchy in weighted and unweighted (atomic unsplittable) congestion games, provided that all cost functions are bounded-degree polynomials with nonnegative coefficients. The given values also hold for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d900ac656ee475a7558fddd91dc50426
https://doi.org/10.1137/090748986
https://doi.org/10.1137/090748986
Publikováno v:
Parallel Computing. 35:544-569
The NP-hard graph partitioning problem is an important subtask in load balancing and many other applications. It requires the division of a graph's vertex set into P equally sized subsets such that some objective function is optimized. State-of-the-a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0da11cb1ebfd31f7631f9ea97a0004d
https://doi.org/10.1016/j.parco.2009.09.006
https://doi.org/10.1016/j.parco.2009.09.006
Publikováno v:
Journal of Parallel and Distributed Computing. 69:750-761
Graph partitioning requires the division of a graph's vertex set into k equally sized subsets s.t. some objective function is optimized. High-quality partitions are important for many applications, whose objective functions are often NP-hard to optim
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f79acafd32d2a93853ee4be3abf24162
https://doi.org/10.1016/j.jpdc.2009.04.005
https://doi.org/10.1016/j.jpdc.2009.04.005