Copertina

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	D'Amico-Wong, Luca, Gonczarowski, Yannai A., Ma, Gary Qiurui, Parkes, David C.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory Computational Complexity
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Pricing with Tips in Three-Sided Delivery Platforms
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2025)

Structural Complexities of Matching Mechanisms
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2022)

Strategyproofness-Exposing Descriptions of Matching Mechanisms
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2022)

Pricing, Matching, and Bundling: an Equilibrium Analysis of Online Platforms
di: Ma, Gary Qiurui
Pubblicazione: (2026)

Platform Equilibrium: Analayzing Social Welfare in Online Market Places
di: Eden, Alon, et al.
Pubblicazione: (2023)

Stable Menus of Public Goods: A Matching Problem
di: Fish, Sara, et al.
Pubblicazione: (2024)

Quantifying Inefficiency
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2024)

On the Complexity of Nucleolus Computation for Bipartite b-Matching Games
di: Koenemann, Jochen, et al.
Pubblicazione: (2021)

Common Knowledge, Regained
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2023)

Multi-District School Choice: Playing on Several Fields
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2024)

Easy as ABCs: Unifying Boltzmann Q-Learning and Counterfactual Regret Minimization
di: D'Amico-Wong, Luca, et al.
Pubblicazione: (2024)

Complexity of Stability in Trading Networks
di: Fleiner, Tamás, et al.
Pubblicazione: (2018)

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
di: Aziz, Haris, et al.
Pubblicazione: (2024)

Zero-Knowledge Mechanisms
di: Canetti, Ran, et al.
Pubblicazione: (2023)

Equilibrium and Selfish Behavior in Network Contagion
di: Zhang, Yi, et al.
Pubblicazione: (2025)

Modelling Network Resilience: The Complexity of Some Graph Division Games
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2026)

Capacity Planning in Stable Matching
di: Bobbio, Federico, et al.
Pubblicazione: (2021)

Describing Deferred Acceptance and Strategyproofness to Participants: Experimental Analysis
di: Gonczarowski, Yannai A., et al.
Pubblicazione: (2024)

Tradeoffs in Privacy, Welfare, and Fairness for Facility Location
di: Fish, Sara, et al.
Pubblicazione: (2026)

Algorithmic Collusion by Large Language Models
di: Fish, Sara, et al.
Pubblicazione: (2024)

Online Revenue Maximization for Server Pricing
di: Boodaghians, Shant, et al.
Pubblicazione: (2019)

On the Smoothed Complexity of Combinatorial Local Search
di: Giannakopoulos, Yiannis, et al.
Pubblicazione: (2022)

How to Resolve Envy by Adding Goods
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
di: Lin, Chuang-Chieh, et al.
Pubblicazione: (2023)

Constant Inapproximability for Fisher Markets
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

Smoothed analysis of deterministic discounted and mean-payoff games
di: Loff, Bruno, et al.
Pubblicazione: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
di: Hansen, Kristoffer Arnsfelt, et al.
Pubblicazione: (2025)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
di: Gao, Ruiquan, et al.
Pubblicazione: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
di: Brânzei, Simina, et al.
Pubblicazione: (2024)

Committee Elections with Candidate Attribute Constraints
di: Zhou, Aizhong, et al.
Pubblicazione: (2024)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
di: Horn, Laryssa, et al.
Pubblicazione: (2025)

Bribery's Influence on Ranked Aggregation
di: Jain, Pallavi, et al.
Pubblicazione: (2026)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2025)

Constant Inapproximability for PPA
di: Deligkas, Argyrios, et al.
Pubblicazione: (2022)

Spatial Voting with Incomplete Voter Information
di: Imber, Aviram, et al.
Pubblicazione: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
di: Becker, Patrick, et al.
Pubblicazione: (2025)

On the Complexity of Learning Nash Equilibria
di: Biggar, Oliver, et al.
Pubblicazione: (2026)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
di: Babichenko, Yakov, et al.
Pubblicazione: (2015)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
di: Ghosh, Abheek, et al.
Pubblicazione: (2024)