Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Danassis, Panayiotis"'
Autor:
Lalan, Arshika, Verma, Shresth, Diaz, Paula Rodriguez, Danassis, Panayiotis, Mahale, Amrita, Sudan, Kumar Madhu, Hegde, Aparna, Tambe, Milind, Taneja, Aparna
Harnessing the wide-spread availability of cell phones, many nonprofits have launched mobile health (mHealth) programs to deliver information via voice or text to beneficiaries in underserved communities, with maternal and infant health being a key a
Externí odkaz:
http://arxiv.org/abs/2407.12131
The success of many healthcare programs depends on participants' adherence. We consider the problem of scheduling interventions in low resource settings (e.g., placing timely support calls from health workers) to increase adherence and/or engagement.
Externí odkaz:
http://arxiv.org/abs/2305.12640
In Federated Learning, it is crucial to handle low-quality, corrupted, or malicious data. However, traditional data valuation methods are not suitable due to privacy concerns. To address this, we propose a simple yet effective approach that utilizes
Externí odkaz:
http://arxiv.org/abs/2205.11518
Traditional competitive markets do not account for negative externalities; indirect costs that some participants impose on others, such as the cost of over-appropriating a common-pool resource (which diminishes future stock, and thus harvest, for eve
Externí odkaz:
http://arxiv.org/abs/2106.06060
We present a multi-agent learning algorithm, ALMA-Learning, for efficient and fair allocations in large-scale systems. We circumvent the traditional pitfalls of multi-agent learning (e.g., the moving target problem, the curse of dimensionality, or th
Externí odkaz:
http://arxiv.org/abs/2105.04027
Publikováno v:
An extended version of this paper has been published in the Autonomous Agents and Multi-Agent Systems (2022)
Can artificial agents benefit from human conventions? Human societies manage to successfully self-organize and resolve the tragedy of the commons in common-pool resources, in spite of the bleak prediction of non-cooperative game theory. On top of tha
Externí odkaz:
http://arxiv.org/abs/2102.02304
A Distributed Differentially Private Algorithm for Resource Allocation in Unboundedly Large Settings
We introduce a practical and scalable algorithm (PALMA) for solving one of the fundamental problems of multi-agent systems -- finding matches and allocations -- in unboundedly large settings (e.g., resource allocation in urban environments, mobility-
Externí odkaz:
http://arxiv.org/abs/2011.07934
Publikováno v:
Artificial Intelligence Review (2022)
We study the optimization of large-scale, real-time ridesharing systems and propose a modular design methodology, Component Algorithms for Ridesharing (CAR). We evaluate a diverse set of CARs (14 in total), focusing on the key algorithmic components
Externí odkaz:
http://arxiv.org/abs/1912.08066
We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound
Externí odkaz:
http://arxiv.org/abs/1902.09359
Autor:
Danassis, Panayiotis, Faltings, Boi
We investigate the problem of multi-agent coordination under rationality constraints. Specifically, role allocation, task assignment, resource allocation, etc. Inspired by human behavior, we propose a framework (CA^3NONY) that enables fast convergenc
Externí odkaz:
http://arxiv.org/abs/1801.07140