Effort profiles in multi-agent resource allocation

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Adaptive Agents and Multi-Agent Systems

• Publication date

  2002-07-15

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/544741.544802
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Agents Overcoming Resource Independent Scaling Threats (AORIST)

  2004cited by this paper
• A Case-Based Reflective Negotiation Model

  2003influential reference
• Phase structure of resource allocation games

  2002cited by this paper
• The Marbles Manifesto: A Definition and Comparison of Cooperative Negotiation Schemes for Distributed Resource Allocation

  2001influential reference
• Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT

  2001cited by this paper
• General Structure of Resource Allocation Games

  2001cited by this paper
• Distributed Constraint Satisfaction

  2000cited by this paper
• Self-organized networks of competing boolean agents

  1999cited by this paper
• State-Space Search

  1999cited by this paper
• Exact solution of a modified El Farol's bar problem: Efficiency and the role of market impact

  1999cited by this paper
• Adaptive Competition, Market Efficiency, and Phase Transitions

  1999cited by this paper
• Learning, competition and cooperation in simple games

  1999cited by this paper
• Phase Transitions and the Search Problem

  1996cited by this paper
• Local Search and the Number of Solutions

  1996cited by this paper
• A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem

  1996cited by this paper
• Hard and Easy Distributions of SAT Problems

  1992influential reference
• Where the Really Hard Problems Are

  1991cited by this paper
• Searching for an Optimal Path in a Tree with Random Costs

  1983cited by this paper
• Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran

  1979cited by this paper
• The complexity of theorem-proving procedures

  1971cited by this paper

• Algorithm Selection for Constraint Optimization Domains

  2013cites this paper
• A real-time cyber-physical energy management system for smart houses

  2011cites this paper
• A Study of Dynamic Coordination Mechanisms

  2009cites this paper
• On emergent complex behaviour, self-organised criticality and phase transitions in multi-agent systems: autonomy oriented computing (AOC) perspectives

  2008influential citation
• Emergent Behavior in Modeling

  2007cites this paper
• Minority Game: A Logic-Based Approach in TuCSoN

  2006cites this paper
• Simulation of Minority Game in TuCSoN

  2006cites this paper
• Simulating Minority Game with TuCSoN

  2006cites this paper
• Pheromone learning for self-organizing agents

  2005cites this paper
• A Survey of Environments and Mechanisms for Human-Human Stigmergy

  2005cites this paper
• Expert Assessment of Stigmergy

  2005cites this paper
• Expert Assessment of Human-Human Stigmergy

  2005cites this paper
• Expert Assessment of Stigmergy: A Report for the Department of National Defence

  2005cites this paper
• AFRL-IFRS-TR-2004-306 Interim Report October 2004 AGENTS OVERCOMING RESOURCE INDEPENDENT SCALING THREATS ( AORIST )

  2004cites this paper
• Agents Overcoming Resource Independent Scaling Threats

  2004cites this paper
• Universality in multi-agent systems

  2004cites this paper
• How to calm hyperactive agents

  2003cites this paper
• Providing Effective Access to Shared Resources: A COIN Approach

  2003cites this paper
• Information-driven phase changes in multi-agent coordination

  2003cites this paper
• AORIST Interim Report

  2003influential citation
• Coordinated aggressive bidding in distributed combinatorial resource allocation

  2003cites this paper