Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

@inproceedings{Danassis2019AnytimeHF,
  title={Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior},
  author={Panayiotis Danassis and Aris Filos-Ratsikas and Boi Faltings},
  booktitle={IJCAI},
  year={2019}
}
  • Panayiotis Danassis, Aris Filos-Ratsikas, Boi Faltings
  • Published in IJCAI 2019
  • Computer Science
  • 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 on the convergence speed that is polynomial in the desired number of resources and competing agents per resource; crucially, in the realistic case where the aforementioned quantities are bounded independently of the total number of agents/resources… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 48 REFERENCES

    Maximum Weight Online Matching with Deadlines

    VIEW 2 EXCERPTS

    Decentralized Anti-coordination Through Multi-agent Learning

    VIEW 2 EXCERPTS

    A distributed auction algorithm for the assignment problem

    VIEW 2 EXCERPTS

    Decentralized hungarian-based approach for fast and scalable task allocation

    • Sarah Ismail, Liang Sun
    • Computer Science
    • 2017 International Conference on Unmanned Aircraft Systems (ICUAS)
    • 2017
    VIEW 2 EXCERPTS

    TaxiSim: A Multiagent Simulation Platform for Evaluating Taxi Fleet Operations

    VIEW 2 EXCERPTS