Learning Approximately Optimal Contracts

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SAGT (15. : 2022 : Colchester) Algorithmic game theory
1. Verfasser: Cohen, Alon (VerfasserIn)
Weitere Verfasser: Deligkas, Argyrios (VerfasserIn), Koren, Moran (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2022
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Budget Feasible Mechanisms for Procurement Auctions with Divisible Agents 2022 Klumper, Sophie
Lookahead Auctions with Pooling 2022 Feldman, Michal
Complexity of Public Goods Games on Graphs 2022 Gilboa, Matan
Fair Ride Allocation on a Line 2022 Amano, Yuki
Gehrlein Stable Committee wıth Multi-modal Preferences 2022 Gupta, Sushmita
Greater Flexibility in Mechanism Design Through Altruism 2022 Brokkelkamp, Ruben
Explicitly Simple Near-Tie Auctions 2022 Meir, Reshef
Cost-Sharing Games with Rank-Based Utilities 2022 Rosner, Shaul
On Tree Equilibria in Max-Distance Network Creation Games 2022 Wang, Qian
On the Impact of Player Capability on Congestion Games 2022 Yang, Yichen
Coopetition Against an Amazon 2022 Gradwohl, Ronen
Fast Convergence of Optimistic Gradient Ascent in Network Zero-Sum Extensive Form Games 2022 Piliouras, Georgios
Decentralized Update Selection with Semi-strategic Experts 2022 Amanatidis, Georgios
Justifying Groups in Multiwinner Approval Voting 2022 Elkind, Edith
Fairness in Temporal Slot Assignment 2022 Elkind, Edith
Strategic Voting in the Context of Stable-Matching of Teams 2022 Schmerler, Leora
Decentralizing Information Technology: The Advent of Resource Based Systems 2022 Kiayias, Aggelos
How Bad is the Merger Paradox? 2022 Blumrosen, Liad
Simultaneous Contests with Equal Sharing Allocation of Prizes: Computational Complexity and Price of Anarchy 2022 Elkind, Edith
PPAD-Complete Pure Approximate Nash Equilibria in Lipschitz Games 2022 Goldberg, Paul W.
Alle Artikel auflisten