default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShiran Rachmilevitch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j22]Benjamin Bachi
, Shiran Rachmilevitch:
Linear and Utilitarian Choice Functions: Revisiting Myerson's Theorem. Math. Oper. Res. 47(2): 989-994 (2022)- 2021
- [j21]Shiran Rachmilevitch:
Step-by-step negotiations and utilitarianism. Int. J. Game Theory 50(2): 433-445 (2021) - [j20]Shiran Rachmilevitch:
No individual priorities and the Nash bargaining solution. Soc. Choice Welf. 56(4): 855-863 (2021) - 2020
- [j19]Shiran Rachmilevitch:
Rewarding moderate behavior in a dynamic Nash Demand Game. Int. J. Game Theory 49(2): 639-650 (2020) - [j18]Shiran Rachmilevitch:
Discounting-sensitivity in symmetric repeated games: An example. Oper. Res. Lett. 48(1): 1-3 (2020) - 2019
- [j17]Dominik Karos, Shiran Rachmilevitch:
The midpoint-constrained egalitarian bargaining solution. Math. Soc. Sci. 101: 107-112 (2019) - [j16]Shiran Rachmilevitch:
On the difficulty of extending the coco value to games with more than two players. Oper. Res. Lett. 47(5): 363-365 (2019) - [j15]Shiran Rachmilevitch:
Egalitarianism, utilitarianism, and the Nash bargaining solution. Soc. Choice Welf. 52(4): 741-751 (2019) - 2018
- [j14]Dominik Karos, Nozomu Muto, Shiran Rachmilevitch:
A generalization of the Egalitarian and the Kalai-Smorodinsky bargaining solutions. Int. J. Game Theory 47(4): 1169-1182 (2018) - 2017
- [j13]Emin Karagözoglu, Shiran Rachmilevitch:
Duality, area-considerations, and the Kalai-Smorodinsky solution. Oper. Res. Lett. 45(1): 30-33 (2017) - [j12]Shiran Rachmilevitch:
Axiomatizations of the equal-loss and weighted equal-loss bargaining solutions. Soc. Choice Welf. 49(1): 1-9 (2017) - 2016
- [j11]Shiran Rachmilevitch:
Symmetry and approximate equilibria in games with countably many players. Int. J. Game Theory 45(3): 709-717 (2016) - 2015
- [j10]Shiran Rachmilevitch:
Bribing in second-price auctions. Games Econ. Behav. 92: 191-205 (2015) - [j9]Shiran Rachmilevitch:
Nash bargaining with (almost) no rationality. Math. Soc. Sci. 76: 107-109 (2015) - 2014
- [j8]Shiran Rachmilevitch:
First-best collusion without communication. Games Econ. Behav. 83: 224-230 (2014) - [j7]Maciej H. Kotowski, Shiran Rachmilevitch:
Bribing in first-price auctions: Corrigendum. Games Econ. Behav. 87: 616-618 (2014) - [j6]Shiran Rachmilevitch:
Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution. Oper. Res. Lett. 42(3): 246-249 (2014) - 2013
- [j5]Shiran Rachmilevitch:
Bribing in first-price auctions. Games Econ. Behav. 77(1): 214-228 (2013) - [j4]Shiran Rachmilevitch:
Endogenous bid rotation in repeated auctions. J. Econ. Theory 148(4): 1714-1725 (2013) - 2012
- [j3]Shiran Rachmilevitch:
Gradual negotiations and proportional solutions. Oper. Res. Lett. 40(6): 459-461 (2012) - 2011
- [j2]Shiran Rachmilevitch:
Disagreement point axioms and the egalitarian bargaining solution. Int. J. Game Theory 40(1): 63-85 (2011) - [j1]Shiran Rachmilevitch:
A characterization of the Kalai-Smorodinsky bargaining solution by disagreement point monotonicity. Int. J. Game Theory 40(4): 691-696 (2011)
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 22:57 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:
