Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
23 Publications
2019 | Conference Paper | LibreCat-ID: 5471
Lazos, Philip, et al. “ Multi-Unit Bilateral Trade.” Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), 2019, doi:10.1609/aaai.v33i01.33011973.
LibreCat
| Files available
| DOI
2019 | Conference Paper | LibreCat-ID: 10281
Feldotto, Matthias, et al. “ From Hotelling to Load Balancing: Approximation and the Principle of Minimum Differentiation.” Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, International Foundation for Autonomous Agents and Multiagent Systems, 2019, pp. 1949--1951.
LibreCat
| Files available
| Download (ext.)
2018 | Conference Paper | LibreCat-ID: 2831
Feldotto, Matthias, et al. “Disaggregating User Evaluations Using the Shapley Value.” Proceedings of the 13th Workshop on Economics of Networks, Systems and Computation (NetEcon 2018), 2018, pp. 5:1-5:6, doi:10.1145/3230654.3230659.
LibreCat
| Files available
| DOI
2018 | Journal Article | LibreCat-ID: 669
Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Journal of Combinatorial Optimization, vol. 36, no. 4, Springer Nature, 2018, pp. 1145–67, doi:10.1007/s10878-017-0189-y.
LibreCat
| Files available
| DOI
| arXiv
2018 | Journal Article | LibreCat-ID: 1369
Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Journal of Combinatorial Optimization, Springer Nature, 2018, doi:10.1007/s10878-018-0269-7.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 112
Feldotto, Matthias, et al. “Congestion Games with Complementarities.” Proceedings of the 10th International Conference on Algorithms and Complexity (CIAC), 2017, pp. 222--233, doi:10.1007/978-3-319-57586-5_19.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 113
Feldotto, Matthias, et al. “Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games.” Proceedings of the 13th International Conference on Web and Internet Economics (WINE), 2017, doi:10.1007/978-3-319-71924-5_14.
LibreCat
| Files available
| DOI
| arXiv
2017 | Conference Paper | LibreCat-ID: 59
Kling, Peter, et al. “Sharing Is Caring: Multiprocessor Scheduling with a Sharable Resource.” Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 123--132, doi:10.1145/3087556.3087578.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 66
Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187, doi:10.1007/978-3-319-62389-4_15.
LibreCat
| Files available
| DOI
2017 | Conference Paper | LibreCat-ID: 1094
Feldotto, Matthias, et al. “Making Gamification Easy for the Professor: Decoupling Game and Content with the StudyNow Mobile App.” Proceedings of the 12th International Conference on Design Science Research in Information Systems and Technology (DESRIST), 2017, pp. 462–67, doi:10.1007/978-3-319-59144-5_32.
LibreCat
| Files available
| DOI
2016 | Conference Paper | LibreCat-ID: 209
Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669, doi:10.1007/978-3-319-48749-6_47.
LibreCat
| Files available
| DOI
| arXiv
2016 | Journal Article | LibreCat-ID: 159
Harks, Tobias, et al. “Routing Games With Progressive Filling.” IEEE/ACM Transactions on Networking, no. 4, IEEE, 2016, pp. 2553–62, doi:10.1109/TNET.2015.2468571.
LibreCat
| Files available
| DOI
2016 | Conference Paper | LibreCat-ID: 149
Drees, Maximilian, et al. “Strategic Online Facility Location.” Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 593--607, doi:10.1007/978-3-319-48749-6_43.
LibreCat
| Files available
| DOI
2015 | Journal Article | LibreCat-ID: 320
Caragiannis, Ioannis, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure.” Transactions on Economics and Computation, vol. 3, no. 1, 2, ACM, 2015, doi:10.1145/2614687.
LibreCat
| Files available
| DOI
2015 | Conference Paper | LibreCat-ID: 271
Drees, Maximilian, et al. “On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games.” Proceedings of the 8th International Symposium on Algorithmic Game Theory (SAGT), 2015, pp. 178–89, doi:10.1007/978-3-662-48433-3_14.
LibreCat
| Files available
| DOI
| arXiv
2014 | Conference Paper | LibreCat-ID: 370
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.
LibreCat
| Files available
| DOI
2014 | Conference Paper | LibreCat-ID: 451
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.
LibreCat
| Files available
| DOI
2014 | Conference Paper | LibreCat-ID: 452
Abshoff, Sebastian, et al. “Brief Announcement: A Model for Multilevel Network Games.” Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), edited by Ron Lavi, 2014, p. 294.
LibreCat
| Files available
2014 | Conference Paper | LibreCat-ID: 453
Feldotto, Matthias, et al. “Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria.” Proceedings of the 10th International Conference on Web and Internet Economics (WINE), 2014, pp. 30–43, doi:10.1007/978-3-319-13129-0_3.
LibreCat
| Files available
| DOI
2014 | Conference Paper | LibreCat-ID: 455
Hansknecht, Christoph, et al. “Approximate Pure Nash Equilibria in Weighted Congestion Games.” Proceedings of the 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2014, pp. 242–57, doi:10.4230/LIPIcs.APPROX-RANDOM.2014.242.
LibreCat
| Files available
| DOI