:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Dey, Palash
Format:	Preprint
Publié:	2016
Sujets:	Multiagent Systems Artificial Intelligence Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/1611.04175
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximizing Value in Challenge the Champ Tournaments
par: Bhaskar, Umang, et autres
Publié: (2025)

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
par: Zhang, Taining, et autres
Publié: (2023)

Smooth Routing in Decaying Trees
par: Fluschnik, Till, et autres
Publié: (2026)

Exact Algorithms for Resource Reallocation Under Budgetary Constraints
par: Das, Arun Kumar, et autres
Publié: (2025)

Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
par: Kim, Jaekwang, et autres
Publié: (2023)

Value-based Resource Matching with Fairness Criteria: Application to Agricultural Water Trading
par: Adiga, Abhijin, et autres
Publié: (2024)

Time and Supply Fairness in Electricity Distribution using $k$-times bin packing
par: Baghel, Dinesh Kumar, et autres
Publié: (2026)

Knapsack: Connectedness, Path, and Shortest-Path
par: Dey, Palash, et autres
Publié: (2023)

Group Trip Planning Query Problem with Multimodal Journey
par: Ali, Dildar, et autres
Publié: (2025)

On the Power of Spatial Locality on Online Routing Problems
par: Guragain, Swapnil, et autres
Publié: (2025)

Query Complexity of Tournament Solutions
par: Maiti, Arnab, et autres
Publié: (2016)

Optimally Improving Cooperative Learning in a Social Setting
par: Haddadan, Shahrzad, et autres
Publié: (2024)

Kidney Exchange: Faster Parameterized Algorithms and Tighter Lower Bounds
par: Banik, Aritra, et autres
Publié: (2025)

Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound
par: Cosson, Romain, et autres
Publié: (2025)

Improved MMS Approximations for Few Agent Types
par: Garg, Jugal, et autres
Publié: (2025)

Agent-based Leader Election, MST, and Beyond
par: Kshemkalyani, Ajay D., et autres
Publié: (2024)

Adaptive Manipulation for Coalitions in Knockout Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

Equilibria in multiagent online problems with predictions
par: Istrate, Gabriel, et autres
Publié: (2024)

EFX Exists for Three Types of Agents
par: HV, Vishwa Prakash, et autres
Publié: (2024)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
par: Kulkarni, Pooja, et autres
Publié: (2025)

Leakage-Robust Bayesian Persuasion
par: Haghtalab, Nika, et autres
Publié: (2024)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
par: Hartman, Eden, et autres
Publié: (2025)

Platforms for Efficient and Incentive-Aware Collaboration
par: Haghtalab, Nika, et autres
Publié: (2024)

Group Fair Matchings using Convex Cost Functions
par: Panda, Atasi, et autres
Publié: (2025)

Reducing Leximin Fairness to Utilitarian Optimization
par: Hartman, Eden, et autres
Publié: (2024)

Dispersion is (Almost) Optimal under (A)synchrony
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Agentic Distributed Computing
par: Kshemkalyani, Ajay D., et autres
Publié: (2025)

Secure and secret cooperation in robotic swarms
par: Ferrer, Eduardo Castelló, et autres
Publié: (2019)

Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents
par: Chand, Prabhat Kumar, et autres
Publié: (2025)

Location-Aware Dispersion on Anonymous Graphs
par: Himani, et autres
Publié: (2026)

Optimal Dispersion Under Asynchrony
par: Pattanayak, Debasish, et autres
Publié: (2025)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
par: Csáji, Gergely
Publié: (2023)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
par: Csáji, Gergely
Publié: (2024)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
par: Hummel, Halvard, et autres
Publié: (2024)

Eliminating Illusion in Directed Networks
par: Jana, Sougata, et autres
Publié: (2026)

Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks
par: Zhang, Yunqi, et autres
Publié: (2024)

Knapsack on Graphs with Relaxed Neighborhood Constraints
par: Dey, Palash, et autres
Publié: (2025)

Extremely Simple Streaming Forest
par: Xu, Haoyin, et autres
Publié: (2021)

An Invertible State Space for Process Trees
par: Kolhof, Gero, et autres
Publié: (2024)

Identification for Tree-shaped Structural Causal Models in Polynomial Time
par: Gupta, Aaryan, et autres
Publié: (2023)