Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID15th SAGT 2022: Colchester, UK
- Panagiotis Kanellopoulos
, Maria Kyropoulou, Alexandros A. Voudouris:
Algorithmic Game Theory - 15th International Symposium, SAGT 2022, Colchester, UK, September 12-15, 2022, Proceedings. Lecture Notes in Computer Science 13584, Springer 2022, ISBN 978-3-031-15713-4
Invited Talk
- Aggelos Kiayias:
Decentralizing Information Technology: The Advent of Resource Based Systems. 3-19
Auctions, Markets and Mechanism Design
- Liad Blumrosen, Yehonatan Mizrahi:
How Bad is the Merger Paradox? 23-40 - Ruben Brokkelkamp, Sjir Hoeijmakers, Guido Schäfer:
Greater Flexibility in Mechanism Design Through Altruism. 41-59 - Michal Feldman, Nick Gravin, Zhihao Gavin Tang, Almog Wald:
Lookahead Auctions with Pooling. 60-77 - Sophie Klumper, Guido Schäfer:
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents. 78-93 - Evangelos Markakis, Georgios Papasotiropoulos, Artem Tsikiridis:
On Improved Interval Cover Mechanisms for Crowdsourcing Markets. 94-112 - Reshef Meir, Riccardo Colini-Baldeschi:
Explicitly Simple Near-Tie Auctions. 113-130
Computational Aspects in Games
- Edith Elkind, Abheek Ghosh, Paul W. Goldberg:
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy. 133-150 - Matan Gilboa, Noam Nisan:
Complexity of Public Goods Games on Graphs. 151-168 - Paul W. Goldberg, Matthew J. Katzman:
PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games. 169-186 - Martin Hoefer, Lisa Wilhelmi:
Seniorities and Minimal Clearing in Financial Network Games. 187-204 - Stavros D. Ioannidis, Bart de Keijzer, Carmine Ventre:
Financial Networks with Singleton Liability Priorities. 205-222 - Sahar Jahani, Bernhard von Stengel:
Automated Equilibrium Analysis of 2˟ 2˟ 2 Games. 223-237
Congestion and Network Creation Games
- Jack Dippel, Adrian Vetta:
An Improved Bound for the Tree Conjecture in Network Creation Games. 241-257 - Fuga Kiyosue, Kenjiro Takazawa:
A Common Generalization of Budget Games and Congestion Games. 258-274 - Shaul Rosner, Tami Tamir:
Cost-Sharing Games with Rank-Based Utilities. 275-292 - Qian Wang:
On Tree Equilibria in Max-Distance Network Creation Games. 293-310 - Yichen Yang, Kai Jia, Martin C. Rinard:
On the Impact of Player Capability on Congestion Games. 311-328
Data Sharing and Learning
- Alon Cohen, Argyrios Deligkas, Moran Koren:
Learning Approximately Optimal Contracts. 331-346 - Ronen Gradwohl, Moshe Tennenholtz:
Coopetition Against an Amazon. 347-365 - Roy Shahmoon, Rann Smorodinsky, Moshe Tennenholtz:
Data Curation from Privacy-Aware Agents. 366-382 - Georgios Piliouras, Lillian J. Ratliff, Ryann Sim, Stratis Skoulakis:
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games. 383-399
Social Choice and Stable Matchings
- Georgios Amanatidis, Georgios Birmpas, Philip Lazos, Francisco J. Marmolejo Cossío:
Decentralized Update Selection with Semi-strategic Experts. 403-420 - Yuki Amano, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hirotaka Ono:
Fair Ride Allocation on a Line. 421-435 - Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana:
Stable Matching with Multilayer Approval Preferences: Approvals Can Be Harder Than Strict Preferences. 436-453 - Martin Durand, Fanny Pascual:
Collective Schedules: Axioms and Algorithms. 454-471 - Edith Elkind, Piotr Faliszewski, Ayumi Igarashi, Pasin Manurangsi, Ulrike Schmidt-Kraepelin, Warut Suksompong:
Justifying Groups in Multiwinner Approval Voting. 472-489 - Edith Elkind, Sonja Kraiczy, Nicholas Teh:
Fairness in Temporal Slot Assignment. 490-507 - Sushmita Gupta, Pallavi Jain, Daniel Lokshtanov, Sanjukta Roy, Saket Saurabh:
Gehrlein Stable Committee with Multi-modal Preferences. 508-525 - Yasushi Kawase, Hanna Sumita:
Online Max-min Fair Allocation. 526-543 - Kazuhisa Makino, Shuichi Miyazaki, Yu Yokoi:
Incomplete List Setting of the Hospitals/Residents Problem with Maximally Satisfying Lower Quotas. 544-561 - Leora Schmerler, Noam Hazon, Sarit Kraus:
Strategic Voting in the Context of Stable-Matching of Teams. 562-579
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-30 20:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
