default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Naroditskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c22]Enrique Areyan Viqueira, Amy Greenwald, Victor Naroditskiy:
On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders. AAMAS 2017: 1466-1468- [i6]Enrique Areyan Viqueira, Amy Greenwald, Victor Naroditskiy:
On Approximate Welfare- and Revenue-Maximizing Equilibria for Size-Interchangeable Bidders. CoRR abs/1708.03097 (2017) - 2016
- [c21]Enrique Areyan Viqueira, Amy Greenwald
, Victor Naroditskiy, Daniels Collins:
On Revenue-Maximizing Walrasian Equilibria for Size-Interchangeable Bidders. AMEC/TADA 2016: 19-34 - 2015
- [j9]Victor Naroditskiy, Richard Steinberg:
Maximizing social welfare in congestion games via redistribution. Games Econ. Behav. 93: 24-41 (2015) - 2014
- [j8]Geoffroy de Clippel, Victor Naroditskiy, Maria Polukarov, Amy Greenwald, Nicholas R. Jennings:
Destroy to save. Games Econ. Behav. 86: 392-404 (2014) - [j7]Florian M. Biermann, Victor Naroditskiy, Maria Polukarov, Tri-Dung Nguyen, Alex Rogers, Nicholas R. Jennings:
Task assignment with controlled and autonomous agents. Math. Soc. Sci. 71: 116-121 (2014) - [c20]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and necessary winner problem in social polls. AAMAS 2014: 613-620 - [c19]Elizabeth M. Hilliard, Amy Greenwald, Victor Naroditskiy:
An Algorithm for the Penalized Multiple Choice Knapsack Problem. ECAI 2014: 1025-1026 - [c18]Victor Naroditskiy, Sebastian Stein, Mirco Tonin, Long Tran-Thanh, Michael Vlassopoulos, Nicholas R. Jennings:
Referral Incentives in Crowdfunding. HCOMP 2014: 171-183 - [c17]Long Tran-Thanh, Lampros C. Stavrogiannis, Victor Naroditskiy, Valentin Robu, Nicholas R. Jennings, Peter B. Key:
Efficient Regret Bounds for Online Bid Optimisation in Budget-Limited Sponsored Search Auctions. UAI 2014: 809-818 - [i5]Amy Greenwald, Seong Jae Lee, Victor Naroditskiy:
RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel. CoRR abs/1401.3829 (2014) - [i4]Talal Rahwan, Victor Naroditskiy, Tomasz P. Michalak, Michael J. Wooldridge, Nicholas R. Jennings:
Towards a Fair Allocation of Rewards in Multi-Level Marketing. CoRR abs/1404.0542 (2014) - 2013
- [j6]Zinovi Rabinovich, Victor Naroditskiy, Enrico H. Gerding, Nicholas R. Jennings:
Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types. Artif. Intell. 195: 106-139 (2013) - [j5]Iyad Rahwan, Sohan Dsouza, Alex Rutherford, Victor Naroditskiy, James McInerney, Matteo Venanzi, Nicholas R. Jennings, Manuel Cebrián:
Global Manhunt Pushes the Limits of Social Mobilization. Computer 46(4): 68-75 (2013) - [j4]Victor Naroditskiy, Maria Polukarov, Nicholas R. Jennings:
Optimal payments in dominant-strategy mechanisms for single-parameter domains. ACM Trans. Economics and Comput. 1(1): 4:1-4:21 (2013) - [c16]Victor Naroditskiy, Sofia Ceppi, Valentin Robu, Nicholas R. Jennings:
Redistribution in online mechanisms. AAMAS 2013: 651-658 - [c15]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and necessary winner problem in social polls. AAMAS 2013: 1131-1132 - [c14]Abdulfatai Popoola, Dmytro Krasnoshtan, Attila-Péter Tóth, Victor Naroditskiy, Carlos Castillo, Patrick Meier, Iyad Rahwan:
Information verification during natural disasters. WWW (Companion Volume) 2013: 1029-1032 - [i3]Serge Gaspers, Victor Naroditskiy, Nina Narodytska, Toby Walsh:
Possible and Necessary Winner Problem in Social Polls. CoRR abs/1302.1669 (2013) - [i2]Victor Naroditskiy, Nicholas R. Jennings, Pascal Van Hentenryck, Manuel Cebrián:
Crowdsourcing Dilemma. CoRR abs/1304.3548 (2013) - [i1]Alex Rutherford, Manuel Cebrián, Iyad Rahwan, Sohan Dsouza, James McInerney, Victor Naroditskiy, Matteo Venanzi, Nicholas R. Jennings, J. R. deLara, Eero Wahlstedt, Steven U. Miller:
Targeted Social Mobilisation in a Global Manhunt. CoRR abs/1304.5097 (2013) - 2012
- [c13]Lachlan Thomas Dufton, Victor Naroditskiy, Maria Polukarov, Nicholas R. Jennings:
Optimizing Payments in Dominant-Strategy Mechanisms for Multi-Parameter Domains. AAAI 2012: 1347-1354 - [c12]Victor Naroditskiy, Mingyu Guo, Lachlan Dufton, Maria Polukarov, Nicholas R. Jennings:
Redistribution of VCG Payments in Public Project Problems. WINE 2012: 323-336 - 2011
- [c11]Mingyu Guo, Victor Naroditskiy, Vincent Conitzer, Amy Greenwald, Nicholas R. Jennings:
Budget-Balanced and Nearly Efficient Randomized Mechanisms: Public Goods and beyond. WINE 2011: 158-169 - 2010
- [b1]Victor Naroditskiy:
Select Problems at the Intersection of Computer Science and Economics. Brown University, USA, 2010 - [c10]Jordan Berg, Amy Greenwald, Victor Naroditskiy, Eric Sodomka:
A Knapsack-Based Approach to Bidding in Ad Auctions. ECAI 2010: 1013-1014
2000 – 2009
- 2009
- [j3]Amy Greenwald, Seong Jae Lee, Victor Naroditskiy:
RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel. J. Artif. Intell. Res. 36: 513-546 (2009) - [c9]Geoffroy de Clippel, Victor Naroditskiy, Amy Greenwald:
Destroy to save. EC 2009: 207-214 - 2008
- [c8]Amy Greenwald, Victor Naroditskiy, Seong Jae Lee:
Bidding Heuristics for Simultaneous Auctions: Lessons from TAC Travel. AMEC/TADA 2008: 131-146 - [c7]Yunhong Zhou, Victor Naroditskiy:
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding. WWW 2008: 1175-1176 - 2007
- [c6]Victor Naroditskiy, Amy Greenwald:
Using Iterated Best-Response to Find Bayes-Nash Equilibria in Auctions. AAAI 2007: 1894-1895 - [c5]Amy Greenwald, Victor Naroditskiy, Tyler Odean, Mauricio Ramirez, Eric Sodomka, Joe Zimmerman, Clark Cutler:
Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM. AMEC/TADA 2007: 217-239 - [c4]Seong Jae Lee, Amy Greenwald, Victor Naroditskiy:
RoxyBot-06: An (SAA)2 TAC Travel Agent. IJCAI 2007: 1378-1383 - 2006
- [j2]Amy Greenwald, Victor Naroditskiy:
Heuristics for the deterministic bidding problem. SIGecom Exch. 6(1): 35-44 (2006) - 2005
- [c3]Amy Greenwald, Bryan Guillemette, Victor Naroditskiy, Michael Carl Tschantz:
Scaling Up the Sample Average Approximation Method for Stochastic Optimization with Applications to Trading Agents. AMEC@AAMAS/TADA@IJCAI 2005: 187-199 - 2004
- [j1]Michael Benisch, Amy Greenwald, Ioanna Grypari, Roger Lederman, Victor Naroditskiy, Michael Carl Tschantz:
Botticelli: a supply chain management agent designed to optimize under uncertainty. SIGecom Exch. 4(3): 29-37 (2004) - [c2]Michael Benisch, Amy Greenwald, Ioanna Grypari, Roger Lederman, Victor Naroditskiy, Michael Carl Tschantz:
Botticelli: A Supply Chain Management Agent. AAMAS 2004: 1174-1181 - [c1]Michael Benisch, Amy Greenwald, Victor Naroditskiy, Michael Carl Tschantz:
A stochastic programming approach to scheduling in TAC SCM. EC 2004: 152-159
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-08-05 21:11 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:
