23 Publications

Mark all

[23]
2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.
LibreCat | Files available | Download (ext.)
 
[22]
2019 | Conference Paper | LibreCat-ID: 5471
Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), n.d.
LibreCat | Files available
 
[21]
2018 | Journal Article | LibreCat-ID: 1369
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.
LibreCat | Files available | DOI
 
[20]
2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
LibreCat | Files available | DOI
 
[19]
2018 | Journal Article | LibreCat-ID: 669
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.
LibreCat | Files available | DOI | arXiv
 
[18]
2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
LibreCat | Files available | DOI | arXiv
 
[17]
2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.
LibreCat | Files available | DOI
 
[16]
2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.
LibreCat | Files available | DOI
 
[15]
2017 | Conference Paper | LibreCat-ID: 113
Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
LibreCat | Files available | DOI | arXiv
 
[14]
2017 | Conference Paper | LibreCat-ID: 1094
Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.
LibreCat | Files available | DOI
 
[13]
2016 | Conference Paper | LibreCat-ID: 149
Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43.
LibreCat | Files available | DOI
 
[12]
2016 | Conference Paper | LibreCat-ID: 209
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.
LibreCat | Files available | DOI | arXiv
 
[11]
2016 | Journal Article | LibreCat-ID: 159
Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.
LibreCat | Files available | DOI
 
[10]
2015 | Conference Paper | LibreCat-ID: 271
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
LibreCat | Files available | DOI | arXiv
 
[9]
2015 | Journal Article | LibreCat-ID: 320
Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation 3, no. 1 (2015). https://doi.org/10.1145/2614687.
LibreCat | Files available | DOI
 
[8]
2014 | Conference Paper | LibreCat-ID: 453
Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.
LibreCat | Files available | DOI
 
[7]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[6]
2014 | Conference Paper | LibreCat-ID: 455
Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.
LibreCat | Files available | DOI
 
[5]
2014 | Conference Paper | LibreCat-ID: 462
Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630.
LibreCat | Files available | DOI
 
[4]
2014 | Conference Paper | LibreCat-ID: 451
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.
LibreCat | Files available | DOI
 
[3]
2014 | Conference Paper | LibreCat-ID: 456
Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 480–85. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43.
LibreCat | Files available | DOI
 
[2]
2014 | Conference Paper | LibreCat-ID: 370
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.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

23 Publications

Mark all

[23]
2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, Matthias, Pascal Lenzner, Louise Molitor, and Alexander Skopalik. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” In Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 1949--1951. International Foundation for Autonomous Agents and Multiagent Systems, 2019.
LibreCat | Files available | Download (ext.)
 
[22]
2019 | Conference Paper | LibreCat-ID: 5471
Lazos, Philip, Paul Goldberg, Alexander Skopalik, Matthias Gerstgrasser, and Bart de Keijzer. “ Multi-Unit Bilateral Trade.” In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), n.d.
LibreCat | Files available
 
[21]
2018 | Journal Article | LibreCat-ID: 1369
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, 2018. https://doi.org/10.1007/s10878-018-0269-7.
LibreCat | Files available | DOI
 
[20]
2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, Matthias, Claus-Jochen Haake, Alexander Skopalik, and Nadja Stroh-Maraun. “Disaggregating User Evaluations Using the Shapley Value.” In Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 5:1-5:6, 2018. https://doi.org/10.1145/3230654.3230659.
LibreCat | Files available | DOI
 
[19]
2018 | Journal Article | LibreCat-ID: 669
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization 36, no. 4 (2018): 1145–67. https://doi.org/10.1007/s10878-017-0189-y.
LibreCat | Files available | DOI | arXiv
 
[18]
2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Complementarities.” In Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 222--233. LNCS, 2017. https://doi.org/10.1007/978-3-319-57586-5_19.
LibreCat | Files available | DOI | arXiv
 
[17]
2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, Alexander Mäcker, Sören Riechers, and Alexander Skopalik. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 123--132, 2017. https://doi.org/10.1145/3087556.3087578.
LibreCat | Files available | DOI
 
[16]
2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 175--187. LNCS, 2017. https://doi.org/10.1007/978-3-319-62389-4_15.
LibreCat | Files available | DOI
 
[15]
2017 | Conference Paper | LibreCat-ID: 113
Feldotto, Matthias, Martin Gairing, Grammateia Kotsialou, and Alexander Skopalik. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” In Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017. https://doi.org/10.1007/978-3-319-71924-5_14.
LibreCat | Files available | DOI | arXiv
 
[14]
2017 | Conference Paper | LibreCat-ID: 1094
Feldotto, Matthias, Thomas John, Dennis Kundisch, Paul Hemsen, Katrin Klingsieck, and Alexander Skopalik. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” In Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 462–67. LNCS, 2017. https://doi.org/10.1007/978-3-319-59144-5_32.
LibreCat | Files available | DOI
 
[13]
2016 | Conference Paper | LibreCat-ID: 149
Drees, Maximilian, Björn Feldkord, and Alexander Skopalik. “Strategic Online Facility Location.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 593--607. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_43.
LibreCat | Files available | DOI
 
[12]
2016 | Conference Paper | LibreCat-ID: 209
Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 655--669. LNCS, 2016. https://doi.org/10.1007/978-3-319-48749-6_47.
LibreCat | Files available | DOI | arXiv
 
[11]
2016 | Journal Article | LibreCat-ID: 159
Harks, Tobias, Martin Höfer, Kevin Schewior, and Alexander Skopalik. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4 (2016): 2553–62. https://doi.org/10.1109/TNET.2015.2468571.
LibreCat | Files available | DOI
 
[10]
2015 | Conference Paper | LibreCat-ID: 271
Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” In Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 178–89. Lecture Notes in Computer Science, 2015. https://doi.org/10.1007/978-3-662-48433-3_14.
LibreCat | Files available | DOI | arXiv
 
[9]
2015 | Journal Article | LibreCat-ID: 320
Caragiannis, Ioannis, Angelo Fanelli, Nick Gravin, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation 3, no. 1 (2015). https://doi.org/10.1145/2614687.
LibreCat | Files available | DOI
 
[8]
2014 | Conference Paper | LibreCat-ID: 453
Feldotto, Matthias, Martin Gairing, and Alexander Skopalik. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 30–43. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_3.
LibreCat | Files available | DOI
 
[7]
2014 | Conference Paper | LibreCat-ID: 395
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Multilevel Network Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 435–40. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_36.
LibreCat | Files available | DOI
 
[6]
2014 | Conference Paper | LibreCat-ID: 455
Hansknecht, Christoph, Max Klimm, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” In Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 242–57. LIPIcs, 2014. https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242.
LibreCat | Files available | DOI
 
[5]
2014 | Conference Paper | LibreCat-ID: 462
Feldotto, Matthias, and Alexander Skopalik. “A Simulation Framework for Analyzing Complex Infinitely Repeated Games.” In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications (SIMULTECH 2014), 625–30, 2014. https://doi.org/10.5220/0005110406250630.
LibreCat | Files available | DOI
 
[4]
2014 | Conference Paper | LibreCat-ID: 451
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.
LibreCat | Files available | DOI
 
[3]
2014 | Conference Paper | LibreCat-ID: 456
Gairing, Martin, Grammateia Kotsialou, and Alexander Skopalik. “Approximate Pure Nash Equilibria in Social Context Congestion Games.” In Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 480–85. LNCS, 2014. https://doi.org/10.1007/978-3-319-13129-0_43.
LibreCat | Files available | DOI
 
[2]
2014 | Conference Paper | LibreCat-ID: 370
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.
LibreCat | Files available | DOI
 
[1]
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, Andreas Cord-Landwehr, Daniel Jung, and Alexander Skopalik. “Brief Announcement: A Model for Multilevel Network Games.” In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 294. LNCS, 2014.
LibreCat | Files available
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed