Postdoc position in formal verification of multi-agent systems
Vadim Malvone <[email protected]> Thu, 13 Mar 2025 14:51:51 +0100
| Newsgroups | gmane.comp.mathematics.hol,gmane.comp.lang.caml.inria,gmane.comp.lang.clean,gmane.comp.lang.erlang.general |
|---|---|
| Message-ID | <[email protected]> |
This is a multi-part message in MIME format. --===============4400830863232952090== Content-Type: multipart/alternative; boundary="------------ePN7qfoOdHEFRj0UGs9yOFaR" Content-Language: fr This is a multi-part message in MIME format. --------------ePN7qfoOdHEFRj0UGs9yOFaR Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: quoted-printable *Study the impact of natural strategies in decision problems* Keywords: Formal Verification, Model Checking for Multi-Agent Systems,=20 Game Theory Description Game theory plays a crucial role in AI by providing a mathematical=20 framework for reasoning about reactive systems, which are defined by=20 interactions between multiple entities, or players. It has found=20 significant applications across various fields, including economics,=20 biology, and computer science. An important application of game theory=20 in computer science and, more recently, in AI, concerns formal-system=20 verification. Model checking, introduced in the late 1970s, uses game=20 theory to verify the behavior of systems against formal specifications.=20 While initial applications focused on closed systems, which are entirely=20 determined by their internal states, most systems in practice are open,=20 involving ongoing interactions. This led to the extension of model=20 checking to Multi-Agent Systems, using logics like Alternating-time=20 Temporal Logic and Strategy Logic to account for strategic reasoning. Another decision problem in verification is synthesis, the process of=20 creating a system that meets its specifications across various=20 environments, particularly those involving rational agents. Rational=20 synthesis, introduced in the 1990s, addresses this by ensuring that a=20 system's behavior aligns with specified objectives across different=20 agent interactions. However, decision problems in MAS verification can=20 range from polynomial to undecidable, with complexity heavily influenced=20 by the type of strategy used (memoryless vs. memoryful). Memoryless=20 strategies are computationally efficient but less expressive, while=20 memoryful strategies are more powerful but more complex. To address=20 these issues, bounded approaches like natural strategies, which consider=20 simpler strategies in line with bounded rationality, have been introduced= . Goals The aim of this project is divided into two main steps: =C2=A0=C2=A0=C2=A0 - Study decision problems for natural strategies and = analyze their=20 computational complexity. =C2=A0=C2=A0=C2=A0 - Develop a tool capable of providing answers to deci= sion problems=20 on natural strategies. Profile and skills required - PhD in computer science, mathematics, or related fields. - Strong computer science and/or mathematical background (with=20 particular attention on formal methods and logic). - Good programming skills. - Good level in written and spoken English. How to apply If you are interested you can apply via:=20 https://institutminestelecom.recruitee.com/l/en/o/post-doctorante-ou-post= -doctorant-en-verification-de-systemes-multi-agents Other information Application deadline: 31/03/2025 Job type: 18 months fixed-term contract in the ANR NOGGINS project Job description: https://partage.imt.fr/index.php/s/69zC4zs8PAt5ZNk Scientific contact person: Vadim Malvone ([email protected]) --------------ePN7qfoOdHEFRj0UGs9yOFaR Content-Type: text/html; charset=UTF-8 Content-Transfer-Encoding: quoted-printable <!DOCTYPE html> <html> <head> <meta http-equiv=3D"Content-Type" content=3D"text/html; charset=3DUTF= -8"> </head> <body> <b>Study the impact of natural strategies in decision problems</b><br= > <br> Keywords: Formal Verification, Model Checking for Multi-Agent Systems, Game Theory<br> <br> Description<br> <br> Game theory plays a crucial role in AI by providing a mathematical framework for reasoning about reactive systems, which are defined by interactions between multiple entities, or players. It has found significant applications across various fields, including economics, biology, and computer science. An important application of game theory in computer science and, more recently, in AI, concerns formal-system verification. Model checking, introduced in the late 1970s, uses game theory to verify the behavior of systems against formal specifications. While initial applications focused on closed systems, which are entirely determined by their internal states, most systems in practice are open, involving ongoing interactions. This led to the extension of model checking to Multi-Agent Systems, using logics like Alternating-time Temporal Logic and Strategy Logic to account for strategic reasoning.<br> <br> Another decision problem in verification is synthesis, the process of creating a system that meets its specifications across various environments, particularly those involving rational agents. Rational synthesis, introduced in the 1990s, addresses this by ensuring that a system's behavior aligns with specified objectives across different agent interactions. However, decision problems in MAS verification can range from polynomial to undecidable, with complexity heavily influenced by the type of strategy used (memoryless vs. memoryful). Memoryless strategies are computationally efficient but less expressive, while memoryful strategies are more powerful but more complex. To address these issues, bounded approaches like natural strategies, which consider simpler strategies in line with bounded rationality, have been introduced.<br> <br> Goals<br> <br> The aim of this project is divided into two main steps:<br> =C2=A0=C2=A0=C2=A0 - Study decision problems for natural strategies a= nd analyze their computational complexity.<br> =C2=A0=C2=A0=C2=A0 - Develop a tool capable of providing answers to d= ecision problems on natural strategies.<br> <br> Profile and skills required<br> <br> - PhD in computer science, mathematics, or related fields.<br> - Strong computer science and/or mathematical background (with particular attention on formal methods and logic).<br> - Good programming skills.<br> - Good level in written and spoken English.<br> <br> How to apply<br> If you are interested you can apply via: <a class=3D"moz-txt-link-freetext" href=3D"https://institutminestelecom.r= ecruitee.com/l/en/o/post-doctorante-ou-post-doctorant-en-verification-de-= systemes-multi-agents">https://institutminestelecom.recruitee.com/l/en/o/= post-doctorante-ou-post-doctorant-en-verification-de-systemes-multi-agent= s</a><br> <br> Other information<br> Application deadline: 31/03/2025<br> Job type: 18 months fixed-term contract in the ANR NOGGINS project<br= > Job description: <a class=3D"moz-txt-link-freetext" href=3D"https://p= artage.imt.fr/index.php/s/69zC4zs8PAt5ZNk">https://partage.imt.fr/index.p= hp/s/69zC4zs8PAt5ZNk</a><br> Scientific contact person: Vadim Malvone (<a class=3D"moz-txt-link-abbreviated" href=3D"mailto:vadim.malvone@t= elecom-paris.fr">[email protected]</a>) </body> </html> --------------ePN7qfoOdHEFRj0UGs9yOFaR-- --===============4400830863232952090== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline --===============4400830863232952090== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ hol-info mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/hol-info --===============4400830863232952090==--