default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFedor Sandomirskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Simina Brânzei, Fedor Sandomirskiy
:
Algorithms for Competitive Division of Chores. Math. Oper. Res. 49(1): 398-429 (2024)- [c7]Federico Echenique, Joseph Root, Fedor Sandomirskiy:
Stable Matching as Transportation. EC 2024: 418 - [c6]Fedor Sandomirskiy, Omer Tamuz:
Decomposable Stochastic Choice. EC 2024: 1195 - [i18]Federico Echenique, Joseph Root, Fedor Sandomirskiy:
Stable matching as transportation. CoRR abs/2402.13378 (2024) - 2023
- [i17]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy:
Persuasion as Transportation. CoRR abs/2307.07672 (2023) - 2022
- [j9]Fedor Sandomirskiy, Erel Segal-Halevi:
Efficient Fair Division with Minimal Sharing. Oper. Res. 70(3): 1762-1782 (2022) - [j8]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
On the Fair Division of a Random Object. Manag. Sci. 68(2): 1174-1194 (2022) - [c5]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy:
Persuasion as Transportation. EC 2022: 468 - [c4]Kevin He, Fedor Sandomirskiy, Omer Tamuz:
Private Private Information. EC 2022: 1145 - [i16]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy:
Bayesian Persuasion with Mediators. CoRR abs/2203.04285 (2022) - [i15]Federico Echenique, Joseph Root, Fedor Sandomirskiy:
Efficiency in Random Resource Allocation and Social Choice. CoRR abs/2203.06353 (2022) - [i14]Alexander Kolesnikov, Fedor Sandomirskiy, Aleh Tsyvinski, Alexander P. Zimin:
Beckmann's approach to multi-item multi-bidder auctions. CoRR abs/2203.06837 (2022) - 2021
- [j7]Anna Bogomolnaia, Misha Gavrilovich, Egor Ianovski, Galina Lyapunova, Hervé Moulin, Alexander S. Nesterov, Marina Sandomirskaia, Fedor Sandomirskiy, Elena Yanovskaya:
In memory of Victoria Kreps (3 September 1945-3 March 2021). Int. J. Game Theory 50(3): 597-601 (2021) - [j6]Reshef Meir, Fedor Sandomirskiy, Moshe Tennenholtz:
Representative Committees of Peers. J. Artif. Intell. Res. 71: 401-429 (2021) - [j5]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible joint posterior beliefs (through examples). SIGecom Exch. 19(1): 21-29 (2021) - [c3]Omer Ben-Porat, Fedor Sandomirskiy, Moshe Tennenholtz:
Protecting the Protected Group: Circumventing Harmful Fairness. AAAI 2021: 5176-5184 - [c2]Itai Arieli, Fedor Sandomirskiy, Rann Smorodinsky:
On Social Networks that Support Learning. EC 2021: 95-96 - [i13]Kevin He, Fedor Sandomirskiy, Omer Tamuz:
Private Private Information. CoRR abs/2112.14356 (2021) - 2020
- [j4]Haris Aziz, Hervé Moulin, Fedor Sandomirskiy:
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5): 573-578 (2020) - [c1]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible Joint Posterior Beliefs. EC 2020: 643 - [i12]Itai Arieli, Yakov Babichenko, Fedor Sandomirskiy, Omer Tamuz:
Feasible Joint Posterior Beliefs. CoRR abs/2002.11362 (2020) - [i11]Reshef Meir, Fedor Sandomirskiy, Moshe Tennenholtz:
Representative Committees of Peers. CoRR abs/2006.07837 (2020) - [i10]Itai Arieli, Fedor Sandomirskiy, Rann Smorodinsky:
On social networks that support learning. CoRR abs/2011.05255 (2020)
2010 – 2019
- 2019
- [j3]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaia:
Dividing bads under additive utilities. Soc. Choice Welf. 52(3): 395-417 (2019) - [i9]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy:
A simple Online Fair Division problem. CoRR abs/1903.10361 (2019) - [i8]Omer Ben-Porat, Fedor Sandomirskiy, Moshe Tennenholtz:
Protecting the Protected Group: Circumventing Harmful Fairness. CoRR abs/1905.10546 (2019) - [i7]Simina Brânzei, Fedor Sandomirskiy:
Algorithms for Competitive Division of Chores. CoRR abs/1907.01766 (2019) - [i6]Fedor Sandomirskiy, Erel Segal-Halevi:
Fair Division with Minimal Sharing. CoRR abs/1908.01669 (2019) - [i5]Haris Aziz, Hervé Moulin, Fedor Sandomirskiy:
A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. CoRR abs/1909.00740 (2019) - 2018
- [j2]Fedor Sandomirskiy:
On Repeated Zero-Sum Games with Incomplete Information and Asymptotically Bounded Values. Dyn. Games Appl. 8(1): 180-198 (2018) - 2017
- [i4]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Competitive division of a mixed manna. CoRR abs/1702.00616 (2017) - 2016
- [i3]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods or bads under additive utilities. CoRR abs/1608.01540 (2016) - [i2]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods and bads under additive utilities. CoRR abs/1610.03745 (2016) - 2015
- [i1]Fedor Sandomirskiy:
On repeated zero-sum games with incomplete information and asymptotically bounded values. CoRR abs/1509.01727 (2015) - 2014
- [j1]Fedor Sandomirskiy:
Repeated games of incomplete information with large sets of states. Int. J. Game Theory 43(4): 767-789 (2014)
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-12-23 19:27 CET 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:
