Copertina

Envy-Free Cake-Cutting for Four Agents

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hollender, Alexandros, Rubinstein, Aviad
Natura:	Preprint
Pubblicazione:	2023
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

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

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

Tight Inapproximability of Nash Equilibria in Public Goods Games
di: Dinh, Jérémi Do, et al.
Pubblicazione: (2024)

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

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

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

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
di: Deligkas, Argyrios, et al.
Pubblicazione: (2026)

Pure-Circuit: Tight Inapproximability for PPAD
di: Deligkas, Argyrios, et al.
Pubblicazione: (2022)

On the Computation of Equilibria in Discrete First-Price Auctions
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2024)

Equilibrium Computation in First-Price Auctions with Correlated Priors
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2025)

On Hierarchies of Fairness Notions in Cake Cutting: From Proportionality to Super Envy-Freeness
di: Mehra, Arnav, et al.
Pubblicazione: (2025)

Envy-Free House Allocation with Minimum Subsidy
di: Choo, Davin, et al.
Pubblicazione: (2024)

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

Computing Equilibrium Points of Electrostatic Potentials
di: Ghosh, Abheek, et al.
Pubblicazione: (2025)

Efficient Equilibrium Computation in Symmetric First-Price Auctions
di: Filos-Ratsikas, Aris, et al.
Pubblicazione: (2026)

Approximate Envy-Freeness in Graphical Cake Cutting
di: Yuen, Sheung Man, et al.
Pubblicazione: (2023)

Min-Max Optimization Requires Exponentially Many Queries
di: Bernasconi, Martino, et al.
Pubblicazione: (2026)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
di: Rothe, Jörg, et al.
Pubblicazione: (2025)

Computational Complexity of Envy-free and Exchange-stable Seat Arrangement Problems on Grid Graphs
di: Kawase, Sota, et al.
Pubblicazione: (2024)

Persuading a Credible Agent
di: Gan, Jiarui, et al.
Pubblicazione: (2024)

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
di: Rubinstein, Aviad
Pubblicazione: (2016)

Fair Division via the Cake-Cutting Share
di: Bai, Yannan, et al.
Pubblicazione: (2024)

Quantum Communication Complexity of Classical Auctions
di: Rubinstein, Aviad, et al.
Pubblicazione: (2023)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
di: Hollender, Alexandros, et al.
Pubblicazione: (2024)

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

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

Reachability of Fair Allocations via Sequential Exchanges
di: Igarashi, Ayumi, et al.
Pubblicazione: (2023)

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

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)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
di: D'Amico-Wong, Luca, et al.
Pubblicazione: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
di: Zhou, Aizhong, 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)

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

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)

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)