Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 12 of 12 for “"algorithmic game theory"”.

  1. The complexity of optimal mechanism design

    … has been a central question in economics and algorithmic game theory, but its complexity has remained poorly understood. We answer this question by showing that a revenue-optimal auction in multi-item settings cannot be found and implemented computationally efficiently, unless ZPP = P # p. …

    mit Repository record for The complexity of optimal mechanism design (opens in a new tab)

  2. The structure of auctions : optimality and efficiency

    … revenue is central to mechanism design and to algorithmic game theory. While the special case of selling a single item has been well understood since the work of Myerson, progress on the multi-item case has been sporadic over the past three decades. In the first part of this thesis we develop a …

    mit Repository record for The structure of auctions : optimality and efficiency (opens in a new tab)

  3. Mechanism design : from optimal transport theory to revenue maximization

    A central problem in Economics and Algorithmic Game Theory is the design of auctions that maximize the auctioneer's expected revenue. While optimal selling of a single item has been well-understood since the pioneering work of Myerson in 1981, extending his work to multi-item settings has remained …

    mit Repository record for Mechanism design : from optimal transport theory to revenue maximization (opens in a new tab)

  4. Graph partitioning: redistricting games and the spherical zoning problem

    Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-08-01

    uiuc Repository record for Graph partitioning: redistricting games and the spherical zoning problem (opens in a new tab)

  5. Fair division of indivisibles: on the computability of maximin share (MMS) allocations

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms

    uiuc Repository record for Fair division of indivisibles: on the computability of maximin share (MMS) allocations (opens in a new tab)

  6. Dynamics and Phenomena in Stateful Multi-Agent Systems

    … many cases, such social systems are inherently algorithmic and strategic; in others, agents may act in simpler behavioral ways in response to some underlying randomness in their environment. In real-world settings, of course, both of these features will likely arise. But regardless of the …

    cornell Repository record for Dynamics and Phenomena in Stateful Multi-Agent Systems (opens in a new tab)

  7. On resource distribution in network coordination game

    … on their friends and families. We develop a new game-theoretical framework to model how people spend their time. Also, we analyze the extreme cases in this model. In addition, we do extensive simulations to understand the average case performance of the steady state. We find that our resource …

    uiuc Repository record for On resource distribution in network coordination game (opens in a new tab)

  8. The complexity of continuous local search

    … for finding a Nash equilibrium in a two-player game directly motivated the definition of the complexity class PPAD, which ended up capturing this problem’s complexity exactly. Finally, we reduce the 2-dimensional version of CONTRACTION to ENDOFPOTENTIALLINE, providing further evidence that …

    uiuc Repository record for The complexity of continuous local search (opens in a new tab)

  9. Peer-to-peer interactive 3D media dissemination in networked virtual environments

    … purpose, such asMassively Multiplayer Online Games (MMOG), while others implement more of foundational frameworks which are not necessarily applications per se, but form platforms to create applications. The latter type of NVEs is referred to as metaverses. One of the premier examples of the …

    nus Repository record for Peer-to-peer interactive 3D media dissemination in networked virtual environments (opens in a new tab)

  10. Algorithms and solution concepts for allocation and collaboration

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for Algorithms and solution concepts for allocation and collaboration (opens in a new tab)

  11. Analysis and design of blockchain systems

    … analysis frames mining as a dynamic mean-field game, identifying equilibrium strategies which guarantee that an attacker cannot profit from a double-spend attack. The third contribution presents a formal computational framework for understanding miner behavior in PoW systems, with a specific …

    texas Repository record for Analysis and design of blockchain systems (opens in a new tab)

  12. Efficient Learning in Team Games: A coordination-competition dilemma

    L'abstract è presente nell'allegato / the abstract is in the attachment

    poli-torino Repository record for Efficient Learning in Team Games: A coordination-competition dilemma (opens in a new tab)