Search results

...hd1.html | author=Judit Csima | title=Investigations on Simple Eco-Grammar Systems | institution=[[Eötvös Loránd University]] | year=2002 }}</ref> Let <math>\mathbb{A}</math> be a simple [[reactive agent]] moving on the table and trying not to fall down from the table with two r ...

'''Inverse Planning''' refers to the process of inferring an agent's mental states, such as goals, beliefs, emotions, etc., from actions by as [[File:InversePlanning.png|thumb|A causal Diagram of agent's goal and actions]] ...

From [[cardinal utility]] perspective, DP means that for each agent, there are two utility levels: low and high, and for every alternative <mat ...for every agent, there is a formula that describes his desired bundles. An agent is satisfied if-and-only-if he receives a bundle that satisfies the formula ...

...quence is a sequence of ''m'' agent-names, where each name determines what agent is the next to pick an item. * Each agent has an [[additive utility]] function (this implies that the items are [[ind ...

...e goal in egalitarian cake-cutting is to maximize the smallest value of an agent; subject to this, maximize the next-smallest value; and so on. It is also c ...element ''i'' is the utility of agent ''i'' divided by the total value for agent ''i''). The '''absolute leximin rule''' chooses an allocation in which the ...

...hat is, in their eyes, at least as good as the share received by any other agent. In other words, no person should feel [[envy]]. ...h that every agent <math>i</math> receives a share <math>X_i</math>. Every agent <math>i</math> has a personal [[preference (economics)|preference relation] ...

...isbn=0-8186-8197-7}}</ref> ATL naturally describes computations of [[multi-agent system]]s and [[Simultaneous game|concurrent games]].<ref>{{cite conference ...Computer Science|series=LCMAS 2003, Logic and Communication in Multi-Agent Systems|volume=85|issue=2|pages=82–93|doi=10.1016/S1571-0661(05)82604-0|issn=1571-0 ...

...s another agent. That is: no agent prefers the bundle allocated to another agent. However, with indivisible items this might be impossible. One approach for *# While there are more items, give the next item to an agent with the smallest total value. ...

|journal=IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans |conference=IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) ...

...Finding in a grid environment.png|thumb|right|upright=1.1|Example of Multi-Agent Path Finding in a grid environment.]] ...r of time steps until all agents reach their goal cells. MAPF is the multi-agent generalization of the [[pathfinding]] problem, and it is closely related to ...

...g]] experiments, researchers try to optimize the performance of a learning agent on a given task, in cooperation or competition with one or more agents. The ...bfdd4adbd-Abstract.html |journal=Advances in Neural Information Processing Systems |publisher=Curran Associates, Inc. |volume=33 |pages=17443–17454|arxiv=2004 ...

...[machine learning]] concerned with creation and modification of [[software agent]]'s knowledge about ''effects'' and ''preconditions'' of the ''actions'' th Learning action models is important when goals change. When an agent acted for a while, it can use its accumulated knowledge about actions in th ...

where <math>w</math> is the [[virtual valuation]] of the agent. So in this case, BO pricing is equivalent to the [[Bayesian-optimal mechan ...inatory pricing scheme is to offer one agent a price of $150 and the other agent a price of $100. Its expected revenue is 0.5*150 + 0.5*100 = $125. ...

...1 (which means that the agent likes the house), or 0 (which means that the agent dislikes the house). * [[Preference (economics)|''Preference ranking'']]: each agent ranks the houses from best to worst. The ranking may be ''strict'' (no indi ...

There are ''n'' agents. Each agent has a function that attributes a numeric value to each "bundle" (combinatio ...en assumed that the agents' value functions are ''linear'', so that if the agent receives a fraction ''r_j'' of each resource ''j'', then his/her ...

...(2nd edition). http://incompleteideas.net/book/the-book-2nd.html</ref> The agent must decide whether to exploit the current best-known policy or explore new === Multi-armed bandit methods === ...

...ing actions that address the [[exploration–exploitation dilemma]] in the [[multi-armed bandit]] problem. It consists of choosing the action that maximizes t ...s subsequently rediscovered numerous times independently in the context of multi-armed bandit problems.<ref name="ref2"/><ref name="ref5"/><ref name="ref6"/ ...

...cesses of collective decision that may not be ordinal: for example, voting systems where voters assign grades to or otherwise rate candidates ([[cardinal voti ...apply to [[Multiwinner voting|multi-winner voting]]. A similar result for multi-winner voting is the [[Duggan–Schwartz theorem]]. ...

...</ref> It is based on the joint-operation of communication and electricity systems. Commelec has been developed by scientists at [[École Polytechnique Fédéral ...amount of [[distributed generation]], modern [[Electric power system|power systems]] are facing numerous challenges<ref name=":0">{{Cite book|url=http://infos ...

...odern Approaches.'' MIT Press, 2024. https://www.marl-book.com/</ref> Each agent is motivated by its own rewards, and does actions to advance its own intere ...ef>{{cite conference | last = Lazaridou | first = Angeliki | title = Multi-Agent Cooperation and The Emergence of (Natural) Language | book-title = ICLR 201 ...