![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Shmuel Zamir
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j16]Bezalel Peleg, Shmuel Zamir:
Judgments aggregation by a sequential majority procedure. Math. Soc. Sci. 95: 37-46 (2018) - 2012
- [j15]Irit Nowik, Shmuel Zamir, Idan Segev
:
Losing the battle but winning the war: game theoretic analysis of the competition between motoneurons innervating a skeletal muscle. Frontiers Comput. Neurosci. 6: 16 (2012) - [j14]Bezalel Peleg, Shmuel Zamir:
Extending the Condorcet Jury Theorem to a general dependent jury. Soc. Choice Welf. 39(1): 91-125 (2012) - 2010
- [j13]Bernhard von Stengel, Shmuel Zamir:
Leadership games with convex strategy sets. Games Econ. Behav. 69(2): 446-457 (2010) - [j12]Salvador Barberà
, Shmuel Zamir:
Memorial. Int. J. Game Theory 39(1-2): 1-2 (2010)
2000 – 2009
- 2009
- [j11]Shmuel Zamir, Salvador Barberà:
A special issue of the IJGT in honor of Michael Maschler. Games Econ. Behav. 65(1): 288 (2009) - [j10]Shmuel Zamir:
Letter from the Editor. Int. J. Game Theory 38(1): 1-2 (2009) - [r1]Shmuel Zamir:
Bayesian Games: Games with Incomplete Information. Encyclopedia of Complexity and Systems Science 2009: 426-441 - 2008
- [j9]Shmuel Zamir:
Teacher, colleague and coauthor. Games Econ. Behav. 64(2): 383-384 (2008) - [j8]Shmuel Zamir:
Biographical information: Michael B. Maschler. Games Econ. Behav. 64(2): 385-387 (2008) - 2004
- [j7]Jean-Marc Tallon
, Jean-Christophe Vergnaud
, Shmuel Zamir:
Communication among Agents: A Way to Revise Beliefs in KD45 Kripke Structures. J. Appl. Non Class. Logics 14(4): 477-500 (2004) - 2003
- [j6]Irit Nowik, Shmuel Zamir:
The game for the speed of convergence in repeated games of incomplete information. Int. J. Game Theory 31(2): 203-222 (2003) - [j5]Bruno Bassan, Olivier Gossner, Marco Scarsini
, Shmuel Zamir:
Positive value of information in games. Int. J. Game Theory 32(1): 17-31 (2003) - 2002
- [j4]Daniel Rothenstein, Shmuel Zamir:
Imperfect Inspection Games Over Time. Ann. Oper. Res. 109(1-4): 175-192 (2002) - 2000
- [j3]Motty Perry, Elmar Wolfstetter
, Shmuel Zamir:
A Sealed-Bid Auction That Matches the English Auction. Games Econ. Behav. 33(2): 265-273 (2000)
1980 – 1989
- 1985
- [j2]Sylvain Sorin, Shmuel Zamir:
A 2-Person Game with Lack of Information on 1½ Sides. Math. Oper. Res. 10(1): 17-23 (1985) - 1981
- [j1]Jean-François Mertens, Shmuel Zamir:
Incomplete Information Games with Transcendental Values. Math. Oper. Res. 6(2): 313-318 (1981)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint