Imagen de Portada

Higher-Order Responsibility

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jiang, Junli, Naumov, Pavel
Formato:	Preprint
Publicado:	2025
Materias:	Artificial Intelligence Computational Complexity Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Responsibility Gap in Collective Decision Making
por: Naumov, Pavel, et al.
Publicado: (2025)

Diffusion of Responsibility in Collective Decision Making
por: Naumov, Pavel, et al.
Publicado: (2025)

Multiwinner Temporal Voting with Aversion to Change
por: Zech, Valentin, et al.
Publicado: (2024)

The Complexity of Optimizing Atomic Congestion
por: Brand, Cornelius, et al.
Publicado: (2023)

A Graph-Theoretical Perspective on Law Design for Multiagent Systems
por: Shi, Qi, et al.
Publicado: (2025)

Mathematical Modelling of Ethical AI Use in Higher Education: A Coordination Game Framework for Future-Facing Learning
por: Ogbo, Ndidi Bianca, et al.
Publicado: (2026)

Intrinsic Barriers and Practical Pathways for Human-AI Alignment: An Agreement-Based Complexity Analysis
por: Nayebi, Aran
Publicado: (2025)

Core Safety Values for Provably Corrigible Agents
por: Nayebi, Aran
Publicado: (2025)

Computing Equilibrium beyond Unilateral Deviation
por: Liu, Mingyang, et al.
Publicado: (2026)

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

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

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

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

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

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

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

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
por: Chen, Xi, et al.
Publicado: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
por: Chatterjee, Debtoru, et al.
Publicado: (2025)

Tarski Lower Bounds from Multi-Dimensional Herringbones
por: Brânzei, Simina, et al.
Publicado: (2025)

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

On Minimal Achievable Quotas in Multiwinner Voting
por: Becker, Patrick, et al.
Publicado: (2025)

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

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

Constant Inapproximability for Fisher Markets
por: Deligkas, Argyrios, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

Constant Inapproximability for PPA
por: Deligkas, Argyrios, et al.
Publicado: (2022)

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

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

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

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

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
por: Bredereck, Robert, et al.
Publicado: (2024)

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

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