An improved algorithm for detecting potential games
Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden i...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Hino, Yusuke [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Schlagwörter: |
|---|
| Systematik: |
|
|---|
| Anmerkung: |
© Springer-Verlag 2010 |
|---|
| Übergeordnetes Werk: |
Enthalten in: International journal of game theory - Springer-Verlag, 1971, 40(2010), 1 vom: 30. Apr., Seite 199-205 |
|---|---|
| Übergeordnetes Werk: |
volume:40 ; year:2010 ; number:1 ; day:30 ; month:04 ; pages:199-205 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00182-010-0233-y |
|---|
| Katalog-ID: |
OLC2041763264 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2041763264 | ||
| 003 | DE-627 | ||
| 005 | 20230323143232.0 | ||
| 007 | tu | ||
| 008 | 200820s2010 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00182-010-0233-y |2 doi | |
| 035 | |a (DE-627)OLC2041763264 | ||
| 035 | |a (DE-He213)s00182-010-0233-y-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a SA 5860 |q VZ |2 rvk | ||
| 084 | |a SA 5860 |q VZ |2 rvk | ||
| 100 | 1 | |a Hino, Yusuke |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a An improved algorithm for detecting potential games |
| 264 | 1 | |c 2010 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag 2010 | ||
| 520 | |a Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. | ||
| 650 | 4 | |a Potential games | |
| 650 | 4 | |a Weighted potential games | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 773 | 0 | 8 | |i Enthalten in |t International journal of game theory |d Springer-Verlag, 1971 |g 40(2010), 1 vom: 30. Apr., Seite 199-205 |w (DE-627)129290653 |w (DE-600)120387-3 |w (DE-576)01447199X |x 0020-7276 |7 nnns |
| 773 | 1 | 8 | |g volume:40 |g year:2010 |g number:1 |g day:30 |g month:04 |g pages:199-205 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00182-010-0233-y |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2088 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4036 | ||
| 912 | |a GBV_ILN_4193 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4314 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4700 | ||
| 936 | r | v | |a SA 5860 |
| 936 | r | v | |a SA 5860 |
| 951 | |a AR | ||
| 952 | |d 40 |j 2010 |e 1 |b 30 |c 04 |h 199-205 | ||
| author_variant |
y h yh |
|---|---|
| matchkey_str |
article:00207276:2010----::nmrvdloihfreetnp |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.1007/s00182-010-0233-y doi (DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ SA 5860 VZ rvk SA 5860 VZ rvk Hino, Yusuke verfasserin aut An improved algorithm for detecting potential games 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. Potential games Weighted potential games Algorithms Computational complexity Enthalten in International journal of game theory Springer-Verlag, 1971 40(2010), 1 vom: 30. Apr., Seite 199-205 (DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X 0020-7276 nnns volume:40 year:2010 number:1 day:30 month:04 pages:199-205 https://doi.org/10.1007/s00182-010-0233-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 SA 5860 SA 5860 AR 40 2010 1 30 04 199-205 |
| spelling |
10.1007/s00182-010-0233-y doi (DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ SA 5860 VZ rvk SA 5860 VZ rvk Hino, Yusuke verfasserin aut An improved algorithm for detecting potential games 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. Potential games Weighted potential games Algorithms Computational complexity Enthalten in International journal of game theory Springer-Verlag, 1971 40(2010), 1 vom: 30. Apr., Seite 199-205 (DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X 0020-7276 nnns volume:40 year:2010 number:1 day:30 month:04 pages:199-205 https://doi.org/10.1007/s00182-010-0233-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 SA 5860 SA 5860 AR 40 2010 1 30 04 199-205 |
| allfields_unstemmed |
10.1007/s00182-010-0233-y doi (DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ SA 5860 VZ rvk SA 5860 VZ rvk Hino, Yusuke verfasserin aut An improved algorithm for detecting potential games 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. Potential games Weighted potential games Algorithms Computational complexity Enthalten in International journal of game theory Springer-Verlag, 1971 40(2010), 1 vom: 30. Apr., Seite 199-205 (DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X 0020-7276 nnns volume:40 year:2010 number:1 day:30 month:04 pages:199-205 https://doi.org/10.1007/s00182-010-0233-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 SA 5860 SA 5860 AR 40 2010 1 30 04 199-205 |
| allfieldsGer |
10.1007/s00182-010-0233-y doi (DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ SA 5860 VZ rvk SA 5860 VZ rvk Hino, Yusuke verfasserin aut An improved algorithm for detecting potential games 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. Potential games Weighted potential games Algorithms Computational complexity Enthalten in International journal of game theory Springer-Verlag, 1971 40(2010), 1 vom: 30. Apr., Seite 199-205 (DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X 0020-7276 nnns volume:40 year:2010 number:1 day:30 month:04 pages:199-205 https://doi.org/10.1007/s00182-010-0233-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 SA 5860 SA 5860 AR 40 2010 1 30 04 199-205 |
| allfieldsSound |
10.1007/s00182-010-0233-y doi (DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p DE-627 ger DE-627 rakwb eng 510 VZ 510 VZ SA 5860 VZ rvk SA 5860 VZ rvk Hino, Yusuke verfasserin aut An improved algorithm for detecting potential games 2010 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 2010 Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. Potential games Weighted potential games Algorithms Computational complexity Enthalten in International journal of game theory Springer-Verlag, 1971 40(2010), 1 vom: 30. Apr., Seite 199-205 (DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X 0020-7276 nnns volume:40 year:2010 number:1 day:30 month:04 pages:199-205 https://doi.org/10.1007/s00182-010-0233-y lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 SA 5860 SA 5860 AR 40 2010 1 30 04 199-205 |
| language |
English |
| source |
Enthalten in International journal of game theory 40(2010), 1 vom: 30. Apr., Seite 199-205 volume:40 year:2010 number:1 day:30 month:04 pages:199-205 |
| sourceStr |
Enthalten in International journal of game theory 40(2010), 1 vom: 30. Apr., Seite 199-205 volume:40 year:2010 number:1 day:30 month:04 pages:199-205 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Potential games Weighted potential games Algorithms Computational complexity |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
International journal of game theory |
| authorswithroles_txt_mv |
Hino, Yusuke @@aut@@ |
| publishDateDaySort_date |
2010-04-30T00:00:00Z |
| hierarchy_top_id |
129290653 |
| dewey-sort |
3510 |
| id |
OLC2041763264 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041763264</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143232.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00182-010-0233-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041763264</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00182-010-0233-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5860</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5860</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hino, Yusuke</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An improved algorithm for detecting potential games</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Potential games</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weighted potential games</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of game theory</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">40(2010), 1 vom: 30. Apr., Seite 199-205</subfield><subfield code="w">(DE-627)129290653</subfield><subfield code="w">(DE-600)120387-3</subfield><subfield code="w">(DE-576)01447199X</subfield><subfield code="x">0020-7276</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:40</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:1</subfield><subfield code="g">day:30</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:199-205</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00182-010-0233-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5860</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5860</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">40</subfield><subfield code="j">2010</subfield><subfield code="e">1</subfield><subfield code="b">30</subfield><subfield code="c">04</subfield><subfield code="h">199-205</subfield></datafield></record></collection>
|
| author |
Hino, Yusuke |
| spellingShingle |
Hino, Yusuke ddc 510 rvk SA 5860 misc Potential games misc Weighted potential games misc Algorithms misc Computational complexity An improved algorithm for detecting potential games |
| authorStr |
Hino, Yusuke |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129290653 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0020-7276 |
| topic_title |
510 VZ SA 5860 VZ rvk An improved algorithm for detecting potential games Potential games Weighted potential games Algorithms Computational complexity |
| topic |
ddc 510 rvk SA 5860 misc Potential games misc Weighted potential games misc Algorithms misc Computational complexity |
| topic_unstemmed |
ddc 510 rvk SA 5860 misc Potential games misc Weighted potential games misc Algorithms misc Computational complexity |
| topic_browse |
ddc 510 rvk SA 5860 misc Potential games misc Weighted potential games misc Algorithms misc Computational complexity |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
International journal of game theory |
| hierarchy_parent_id |
129290653 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
International journal of game theory |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129290653 (DE-600)120387-3 (DE-576)01447199X |
| title |
An improved algorithm for detecting potential games |
| ctrlnum |
(DE-627)OLC2041763264 (DE-He213)s00182-010-0233-y-p |
| title_full |
An improved algorithm for detecting potential games |
| author_sort |
Hino, Yusuke |
| journal |
International journal of game theory |
| journalStr |
International journal of game theory |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
txt |
| container_start_page |
199 |
| author_browse |
Hino, Yusuke |
| container_volume |
40 |
| class |
510 VZ SA 5860 VZ rvk |
| format_se |
Aufsätze |
| author-letter |
Hino, Yusuke |
| doi_str_mv |
10.1007/s00182-010-0233-y |
| dewey-full |
510 |
| title_sort |
an improved algorithm for detecting potential games |
| title_auth |
An improved algorithm for detecting potential games |
| abstract |
Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. © Springer-Verlag 2010 |
| abstractGer |
Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. © Springer-Verlag 2010 |
| abstract_unstemmed |
Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game. © Springer-Verlag 2010 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_26 GBV_ILN_39 GBV_ILN_70 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4193 GBV_ILN_4277 GBV_ILN_4314 GBV_ILN_4318 GBV_ILN_4700 |
| container_issue |
1 |
| title_short |
An improved algorithm for detecting potential games |
| url |
https://doi.org/10.1007/s00182-010-0233-y |
| remote_bool |
false |
| ppnlink |
129290653 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00182-010-0233-y |
| up_date |
2024-07-04T05:24:17.881Z |
| _version_ |
1803624810146693120 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041763264</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323143232.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2010 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00182-010-0233-y</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041763264</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00182-010-0233-y-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5860</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 5860</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hino, Yusuke</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">An improved algorithm for detecting potential games</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag 2010</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This note presents a simple necessary and sufficient condition for a game to be a potential game. My condition improves on the well-known condition in Monderer and Shapley (Games Econ Behav 14:124–143, 1996) in the sense that it leads to a significant reduction in the computational burden in determining whether a given game is a potential game. It also provides a logical connection between finite and continuous potential games, as it can be understood as a faithful translation of one type of characterization for a continuous potential game.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Potential games</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weighted potential games</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">International journal of game theory</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">40(2010), 1 vom: 30. Apr., Seite 199-205</subfield><subfield code="w">(DE-627)129290653</subfield><subfield code="w">(DE-600)120387-3</subfield><subfield code="w">(DE-576)01447199X</subfield><subfield code="x">0020-7276</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:40</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:1</subfield><subfield code="g">day:30</subfield><subfield code="g">month:04</subfield><subfield code="g">pages:199-205</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00182-010-0233-y</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5860</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 5860</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">40</subfield><subfield code="j">2010</subfield><subfield code="e">1</subfield><subfield code="b">30</subfield><subfield code="c">04</subfield><subfield code="h">199-205</subfield></datafield></record></collection>
|
| score |
7.39985 |