Advertisement

Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation

  • Abdallah Saffidine
  • Anaëlle WilczynskiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11059)

Abstract

We examine a resource allocation problem where each agent is to be assigned exactly one object. Agents are initially endowed with a resource that they can swap with one another. However, not all exchanges are plausible: we represent required connections between agents with a social network. Agents may only perform pairwise exchanges with their neighbors and only if it brings them preferred objects. We analyze this distributed process through two dual questions. Could an agent obtain a certain object if the swaps occurred favourably? Can an agent be guaranteed a certain level of satisfaction regardless of the actual exchanges? These questions are investigated through parameterized complexity, focusing on budget constraints such as the number of exchanges an agent may be involved in or the total duration of the process.

Keywords

Resource allocation Distributed process Social network Parameterized complexity 

References

  1. 1.
    Abdulkadiroǧlu, A., Sönmez, T.: House allocation with existing tenants. J. Econ. Theory 88(2), 233–260 (1999)CrossRefGoogle Scholar
  2. 2.
    Abrahamson, K.A., Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues. Ann. Pure Appl. Log. 73(3), 235–276 (1995)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Aziz, H., Biró, P., Lang, J., Lesca, J., Monnot, J.: Optimal reallocation under additive and ordinal preferences. In: AAMAS. pp. 402–410 (2016)Google Scholar
  4. 4.
    Aziz, H., De Keijzer, B.: Housing markets with indifferences: a tale of two mechanisms. In: AAAI. pp. 1249–1255 (2012)Google Scholar
  5. 5.
    Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of max-3sat. Technical report (2004)Google Scholar
  6. 6.
    Chevaleyre, Y., et al.: Issues in multiagent resource allocation. Informatica 30(1), 3–31 (2006)zbMATHGoogle Scholar
  7. 7.
    Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation in k-additive domains: preference representation and complexity. Ann. Oper. Res. 163(1), 49–62 (2008)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: Negotiating over small bundles of resources. In: AAMAS. pp. 296–302 (2005)Google Scholar
  9. 9.
    Chevaleyre, Y., Endriss, U., Maudet, N.: Allocating goods on a graph to eliminate envy. In: AAAI. pp. 700–705 (2007)Google Scholar
  10. 10.
    Damamme, A., Beynier, A., Chevaleyre, Y., Maudet, N.: The power of swap deals in distributed resource allocation. In: AAMAS. pp. 625–633 (2015)Google Scholar
  11. 11.
    Dunne, P.E., Chevaleyre, Y.: The complexity of deciding reachability properties of distributed negotiation schemes. Theor. Comput. Sci. 396(1–3), 113–144 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Dunne, P.E., Wooldridge, M., Laurence, M.: The complexity of contract negotiation. Artif. Intell. 164(1–2), 23–46 (2005)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Easley, D., Kleinberg, J.: Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, New York (2010)CrossRefGoogle Scholar
  14. 14.
    Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating socially optimal allocations of resources. J. Artif. Intell. Res. 25, 315–348 (2006)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)zbMATHGoogle Scholar
  16. 16.
    Gourvès, L., Lesca, J., Wilczynski, A.: Object allocation via swaps along a social network. In: IJCAI. pp. 213–219 (2017)Google Scholar
  17. 17.
    Jackson, M.O.: Social and Economic Networks. Princeton University Press, Princeton (2008)Google Scholar
  18. 18.
    Sandholm, T.W.: Contract types for satisficing task allocation. In: AAAI Spring Symposium. pp. 23–25 (1998)Google Scholar
  19. 19.
    Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23–37 (1974)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.College of Engineering & Computer ScienceAustralian National UniversityCanberraAustralia
  2. 2.PSL, CNRS, LAMSADEUniversité Paris-DauphineParisFrance

Personalised recommendations