Algorithmic Game Theory
-
Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21–24, 2021, Proceedings
By Ioannis Caragiannis, Kristoffer Arnsfelt HansenBateni, M.H., Hajiaghayi, M.T., Immorlica, N., Mahini, H.: The cooperative game theory foundations of network bargaining games. In: Abramsky, S., Gavoille, ... Game Theory And Equilibria. Springer Optimization and Its Applications, vol.
-
Algorithmic Game Theory
By Tim Roughgarden, Éva Tardos, Noam NisanIn the last few years game theory has had a substantial impact on computer science, especially on Internet- and e-commerce-related issues.
-
Algorithmic Game Theory
By Tim Roughgarden, Éva Tardos, Noam NisanThis theorem has been generalized to wider classes of nonatomic games; see Roughgarden (2005 a) for a survey, as well as a discussion of the price of anarchy of nonatomic selfish routing games with nonutilitarian objectives.
-
Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool, UK, September 19–21, 2016, Proceedings
By Martin Gairing, Rahul SavaniWhen X is clear from the context we will simply say that a vector is k uniform without mentioning that uniformity is with respect to X. Games and Strategies. A game with M players can be described by a set of available actions for each ...
-
Algorithmic Game Theory: 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings
By Xiaotie DengCorrelation-Robust. Mechanism. Design. Pinyan Lu ITCS, Shanghai University of Finance and Economics, Shanghai, ... Any mechanism is then evaluated according to its expected profit in the worst-case, over all possible joint distributions ...
-
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings
By Spyros KontogiannisIf the number of jobs on any machine increases, then that machine will experience a latency of at least u. Since all jobs are currently experiencing a cost of at most u, the latency of any job after moving to a different machine will ...
-
Algorithmic Game Theory: 6th International Symposium, SAGT 2013, Aachen, Germany, October 21-23, 2013, Proceedings
By Berthold VöckingThis book constitutes the proceedings of the 6th International Symposium on Algorithmic Game Theory, SAGT 2013, held in Aachen, Germany, in October 2013.
-
Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings
By Ioannis Caragiannis, Kristoffer Arnsfelt HansenThis book constitutes the refereed proceedings of the 14th International Symposium on Algorithmic Game Theory, SAGT 2021, held in Aarhus, Denmark in September 2021.
-
Algorithmic Game Theory: 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings
By Maria SernaThis book constitutes the refereed proceedings of the 5th International Symposium on Algorithmic Game Theory, SAGT 2012, held in Barcelona, Spain, in October 2012.
-
Algorithmic Game Theory: Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings
By Paul Spirakis, Elias Koutsoupias, Spyros Kontogiannis... change the objective in LP (S) to maximize y1, and let its optimal objective function value be a 2. If a 1 < a.2, we are in the first case. Define b1 = (3–a1)/a and b2 = (3-a2)/a. Then, the endpoints of the facet y1 + ay2 = 3 are (a1 ...
-
Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 -- October 2, 2014, Proceedings
By Ron Lavi... the stable marriage problem with one-sided ties. Algorithmica 68(3), 758–775 (2014) [15] Knuth, D.: Stable marriage and its relation to other combinatorial problems: An introduction to the mathematical analysis of algorithms. Amer. Math ...
-
Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28-30, 2015. Proceedings
By Martin Hoefer... stable marriages. J. Comput. Syst. Sci. 45, 233–284 (1992) 7. Feder, T.: Network flow and 2-satisfiability ... its applications. Math. Oper. Res. 23(4), 874–891 (1998) Pareto Optimal Matchings in Many-to-Many Markets with Ties Katar ́ına ...