default search action
Igal Milchtaich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j17]Igal Milchtaich
:
Best-response equilibrium: an equilibrium in finitely additive mixed strategies. Int. J. Game Theory 52(4): 1317-1334 (2023) - 2021
- [j16]Srinivas Arigapudi, Yuval Heller, Igal Milchtaich
Instability of defection in the prisoner's dilemma under best experienced payoff dynamics. J. Econ. Theory 197: 105174 (2021)
2010 – 2019
- 2019
- [j15]Igal Milchtaich
Polyequilibrium. Games Econ. Behav. 113: 339-355 (2019) - [c5]Shani Alkoby, David Sarne, Igal Milchtaich
Strategic Signaling for Selling Information Goods. IJCAI 2019: 25-31 - 2017
- [c4]Shani Alkoby, David Sarne, Igal Milchtaich:
Strategic Signaling and Free Information Disclosure in Auctions. AAAI 2017: 319-327 - 2015
- [j14]Igal Milchtaich
Network topology and equilibrium existence in weighted network congestion games. Int. J. Game Theory 44(3): 515-541 (2015) - 2014
- [j13]Igal Milchtaich
Implementability of correlated and communication equilibrium outcomes in incomplete information games. Int. J. Game Theory 43(2): 283-350 (2014) - 2013
- [j12]Igal Milchtaich
Representation of finite games as network congestion games. Int. J. Game Theory 42(4): 1085-1096 (2013) - 2012
- [j11]Igal Milchtaich
Comparative statics of altruism and spite. Games Econ. Behav. 75(2): 809-831 (2012) - 2011
- [c3]Igal Milchtaich:
Representation of finite games as network congestion games. NetGCoop 2011: 1-5
2000 – 2009
- 2009
- [j10]Igal Milchtaich
Weighted congestion games with separable preferences. Games Econ. Behav. 67(2): 750-757 (2009) - 2007
- [j9]Ruth Ben-Yashar, Igal Milchtaich
First and second best voting rules in committees. Soc. Choice Welf. 29(3): 453-486 (2007) - [c2]Marios Mavronicolas
Congestion Games with Player-Specific Constants. MFCS 2007: 633-644 - 2006
- [j8]Igal Milchtaich
Network topology and the efficiency of equilibrium. Games Econ. Behav. 57(2): 321-346 (2006) - [j7]Igal Milchtaich
Computation of Completely Mixed Equilibrium Payoffs in Bimatrix Games. IGTR 8(3): 483-487 (2006) - [c1]Igal Milchtaich
The Equilibrium Existence Problem in Finite Network Congestion Games. WINE 2006: 87-98 - 2005
- [j6]Igal Milchtaich
Topological Conditions for Uniqueness of Equilibrium in Networks. Math. Oper. Res. 30(1): 225-244 (2005) - 2004
- [j5]Igal Milchtaich
Random-player games. Games Econ. Behav. 47(2): 353-388 (2004) - [j4]Igal Milchtaich
Social optimality and cooperation in nonatomic congestion games. J. Econ. Theory 114(1): 56-87 (2004) - 2002
- [j3]Igal Milchtaich
Stability and Segregation in Group Formation. Games Econ. Behav. 38(2): 318-346 (2002) - 2000
- [j2]Igal Milchtaich
Generic Uniqueness of Equilibrium in Large Crowding Games. Math. Oper. Res. 25(3): 349-364 (2000)
1990 – 1999
- 1998
- [j1]Igal Milchtaich
Crowding games are sequentially solvable. Int. J. Game Theory 27(4): 501-509 (1998)
Coauthor Index
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-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: