Skip to main content
Springer Nature Link
Log in

Algorithmic Game Theory

16th International Symposium, SAGT 2023, Egham, UK, September 4–7, 2023, Proceedings

  • Conference proceedings
  • © 2023

Overview

Editors:
  1. Argyrios Deligkas

    1. Royal Holloway University of London, Egham, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Aris Filos-Ratsikas

    1. University of Edinburgh, Edinburgh, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 14238)

Included in the following conference series:

Conference proceedings info: SAGT 2023.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the proceedings of the 16th International Symposium on Algorithmic Game Theory, SAGT 2023, which took place in Egham, UK, in September 2023. 

The 26 full papers included in this book were carefully reviewed and selected from 59 submissions. They were organized in topical sections as follows: ​computational aspects and efficiency in games; computational social choice; fair division; matching and mechanism design.

Keywords

Table of contents (23 papers)

  1. Front Matter

    Pages i-xxvii
    Download chapter PDF

  2. Computational Aspects and Efficiency in Games

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Computation of Nash Equilibria of Attack and Defense Games on Networks

      • Stanisław Kaźmierowski, Marcin Dziubiński
      Pages 3-21

    3. Stackelberg Vertex Cover on a Path

      • Katharina Eickhoff, Lennart Kauther, Britta Peis
      Pages 22-39

    4. Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games

      • Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas
      Pages 40-57

    5. Arbitrary Profit Sharing in Federated Learning Utility Games

      • Eirini Georgoulaki, Kostas Kollias
      Pages 58-70

    6. The Contest Game for Crowdsourcing Reviews

      • Marios Mavronicolas, Paul G. Spirakis
      Pages 71-89

    7. Entrepreneurship Facility-Activation Games

      • Shaul Rosner, Tami Tamir
      Pages 90-108

  3. Computational Social Choice

    1. Front Matter

      Pages 109-109
      Download chapter PDF

    2. Single-Peaked Jump Schelling Games

      • Tobias Friedrich, Pascal Lenzner, Louise Molitor, Lars Seifert
      Pages 111-126

    3. Parameterized Complexity of Gerrymandering

      • Andrew Fraser, Brian Lavallee, Blair D. Sullivan
      Pages 127-141

    4. Coordinating Monetary Contributions in Participatory Budgeting

      • Haris Aziz, Sujit Gujar, Manisha Padala, Mashbat Suzuki, Jeremy Vollen
      Pages 142-160

    5. Robustness of Participatory Budgeting Outcomes: Complexity and Experiments

      • Niclas Boehmer, Piotr Faliszewski, Łukasz Janeczko, Andrzej Kaczmarczyk
      Pages 161-178

    6. Into the Unknown: Assigning Reviewers to Papers with Uncertain Affinities

      • Cyrus Cousins, Justin Payan, Yair Zick
      Pages 179-197

    7. Diversity-Seeking Jump Games in Networks

      • Lata Narayanan, Yasaman Sabbagh
      Pages 198-217

  4. Fair Division

    1. Front Matter

      Pages 219-219
      Download chapter PDF

    2. Maximin Fair Allocation of Indivisible Items Under Cost Utilities

      • Sirin Botan, Angus Ritossa, Mashbat Suzuki, Toby Walsh
      Pages 221-238

    3. Fair Algorithm Design: Fair and Efficacious Machine Scheduling

      • April Niu, Agnes Totschnig, Adrian Vetta
      Pages 239-256

    4. EFX Allocations for Indivisible Chores: Matching-Based Approach

      • Yusuke Kobayashi, Ryoga Mahara, Souta Sakamoto
      Pages 257-270

    5. The Price of Equity with Binary Valuations and Few Agent Types

      • Umang Bhaskar, Neeldhara Misra, Aditi Sethia, Rohit Vaish
      Pages 271-289
Back to top

Other volumes

  1. Algorithmic Game Theory

Editors and Affiliations

  • Royal Holloway University of London, Egham, UK

    Argyrios Deligkas

  • University of Edinburgh, Edinburgh, UK

    Aris Filos-Ratsikas

Bibliographic Information

Publish with us

Policies and ethics

Back to top